

A105677


Highest minimal Hamming distance of any Type 4^E Euclidean linear selfdual code over GF(4) of length 2n.


19




OFFSET

1,1


COMMENTS

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 selfdual 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 selfdual codes, Preprint.


LINKS

Table of n, a(n) for n=1..8.
G. Nebe, E. M. Rains and N. J. A. Sloane, SelfDual Codes and Invariant Theory, Springer, Berlin, 2006.
P. Gaborit, Tables of SelfDual Codes
E. M. Rains and N. J. A. Sloane, Selfdual codes, pp. 177294 of Handbook of Coding Theory, Elsevier, 1998; (Abstract, pdf, ps).


CROSSREFS

Cf. A105674, A105675, A105676, A105678, A016729, A066016, A105681, A105682.
Sequence in context: A322007 A226107 A318283 * A230476 A103297 A274017
Adjacent sequences: A105674 A105675 A105676 * A105678 A105679 A105680


KEYWORD

nonn


AUTHOR

N. J. A. Sloane, May 06 2005


EXTENSIONS

The sequence continues: a(9) = either 6 or 7, a(10) = a(11) = 8, a(12) = 8, 9 or 10, ...


STATUS

approved



