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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A016729 Highest minimal Hamming distance of any Type 4^H+ Hermitian additive self-dual code over GF(4) of length n. 19
1, 2, 2, 2, 3, 4, 3, 4, 4, 4, 5, 6, 5, 6, 6, 6, 7, 8, 7, 8, 8, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

P. Gaborit and A. Otmani, Experimental construction of self-dual codes, Preprint.

LINKS

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

G. Nebe, E. M. Rains and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006.

A. R. Calderbank, E. M. Rains, P. W. Shor and N. J. A. Sloane, Quantum error correction via codes over GF(4), IEEE Trans. Inform. Theory, 44 (1998), 1369-1387.

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, A105678, A066016, A105681, A105682.

A105687 gives the number of codes with this minimal distance.

Sequence in context: A187181 A211187 A241504 * A155940 A186963 A060473

Adjacent sequences:  A016726 A016727 A016728 * A016730 A016731 A016732

KEYWORD

nonn

AUTHOR

N. J. A. Sloane. Entry revised May 06 2005

EXTENSIONS

The sequence continues: a(23) = 8 or 9, a(24) = 8, 9 or 10, a(25) = 8 or 9, ...

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 October 16 14:35 EDT 2018. Contains 316263 sequences. (Running on oeis4.)