|
Search: id:A105678
|
|
|
| A105678 |
|
Highest minimal Hamming distance of any Type 4^H Hermitian linear self-dual code over GF(4) of length 2n. |
|
+0
20
|
|
| 2, 2, 4, 4, 4, 4, 6, 6, 8, 8, 8, 8, 8, 10, 12
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
P. Gaborit and A. Otmani, Experimental construction of self-dual codes, Prepint.
W. C. Huffman, On the classification and enumeration of self-dual codes, Finite Fields Applic. 11 (2005), 451-490.
|
|
LINKS
|
G. Nebe, E. M. Rains and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006.
P. Gaborit, Tables of Self-Dual Codes
E. M. Rains and N. J. A. Sloane, Self-dual codes, pp. 177-294 of Handbook of Coding Theory, Elsevier, 1998; (Abstract, pdf, ps).
|
|
CROSSREFS
|
Cf. A105674, A105675, A105676, A105677, A016729, A066016, A105681, A105682.
Cf. also A105686 for the numbers of such codes.
Adjacent sequences: A105675 A105676 A105677 this_sequence A105679 A105680 A105681
Sequence in context: A100144 A076222 A098667 this_sequence A028397 A053644 A039593
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, May 06 2005
|
|
EXTENSIONS
|
The next term a(16) is either 10 or 12.
|
|
|
Search completed in 0.002 seconds
|
