### Abstract

What is the maximum possible number, f_{3}(n), of vectors of length n over {0,1,2} such that the Hamming distance between every two is even? What is the maximum possible number, g^{3}(n), of vectors in {0,1,2} ^{n} such that the Hamming distance between every two is odd? We investigate these questions, and more general ones, by studying Xor powers of graphs, focusing on their independence number and clique number, and by introducing two new parameters of a graph G. Both parameters denote limits of series of either clique numbers or independence numbers of the Xor powers of G (normalized appropriately), and while both limits exist, one of the series grows exponentially as the power tends to infinity, while the other grows linearly. As a special case, it follows that f_{3}(n) = Θ(2^{n} ) whereas g_{3}(n)=Θ(n).

Original language | English (US) |
---|---|

Pages (from-to) | 13-33 |

Number of pages | 21 |

Journal | Combinatorica |

Volume | 27 |

Issue number | 1 |

DOIs | |

State | Published - Feb 1 2007 |

Externally published | Yes |

### All Science Journal Classification (ASJC) codes

- Discrete Mathematics and Combinatorics
- Computational Mathematics

### Keywords

- 05C69
- 94A15

## Fingerprint Dive into the research topics of 'Codes and Xor graph products'. Together they form a unique fingerprint.

## Cite this

*Combinatorica*,

*27*(1), 13-33. https://doi.org/10.1007/s00493-007-0042-5