login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105677 Highest minimal Hamming distance of any Type 4^E Euclidean linear self-dual code over GF(4) of length 2n. 19
2, 3, 3, 4, 4, 6, 6, 6 (list; graph; refs; listen; history; text; internal format)
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 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, Preprint.

LINKS

Table of n, a(n) for n=1..8.

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: A266475 A205402 A226107 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 25 04:05 EST 2018. Contains 299630 sequences. (Running on oeis4.)