|
Search: id:A105677
|
|
|
| A105677 |
|
Highest minimal Hamming distance of any Type 4^E Euclidean linear self-dual code over GF(4) of length 2n. |
|
+0
20
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
There is a related sequence which is presently too short to include: Highest minimal Lee distance of any Type (4^E)_II Euclidean linear even self-dual code over GF(4) of length 4n. This begins 4, 4, 8, 8, 8, then either 8 or 12, 12, 12, ...
|
|
REFERENCES
|
P. Gaborit and A. Otmani, Experimental construction of self-dual codes, Prepint.
|
|
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, A105678, A016729, A066016, A105681, A105682.
Sequence in context: A070046 A130120 A127434 this_sequence A103297 A095916 A130121
Adjacent sequences: A105674 A105675 A105676 this_sequence A105678 A105679 A105680
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, May 06 2005
|
|
EXTENSIONS
|
The sequence continues: a(9) = either 6 or 7, a(10) = a(11) = 8, a(12) = 8, 9 or 10, ...
|
|
|
Search completed in 0.002 seconds
|
