|
Search: id:A128036
|
|
|
| A128036 |
|
Maximal possible number of vectors in {0,1,2}^n such that the Hamming distance between every two is odd. |
|
+0
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The sequence f_3(n) (the analog for even Hamming distances) is probably 2^{n-1} for odd values of n and that value plus 1 for even n.
|
|
REFERENCES
|
N. Alon and E. Lubetzky, Codes and XOR graph products, Combinatorica, 27 (No. 1, 2007), 13-33. [See g_3(n).]
|
|
CROSSREFS
|
Adjacent sequences: A128033 A128034 A128035 this_sequence A128037 A128038 A128039
Sequence in context: A086239 A016605 A060372 this_sequence A045794 A065678 A022598
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
Alon Noga (nogaa(AT)post.tau.ac.il) and Eyal Lubetzky (lubetzky(AT)post.tau.ac.il), May 03 2007
|
|
|
Search completed in 0.002 seconds
|
