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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110867 Highest minimal distance of Type I but not Type II additive Hermitian self-dual codes of length n over GF(4). 0
1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

L. E. Danielsen and M. G. Parker, On the classification of all self-dual additive codes over GF(4) of length up to 12, J. Combin. Theory A 113 (7) (2006) 1351-1367.

L. E. Danielsen and M. G. Parker, On the classification of all self-dual additive codes over GF(4) of length up to 12, arXiv:math/0504522 [math.CO], 2005-2006.

W. C. Huffman, On the classification and enumeration of self-dual codes, Finite Fields Applic., 11 (2005), 451-490.

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

CROSSREFS

Sequence in context: A091497 A005707 A087828 * A006670 A132914 A060646

Adjacent sequences:  A110864 A110865 A110866 * A110868 A110869 A110870

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Sep 19 2005

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 15 22:19 EDT 2019. Contains 324145 sequences. (Running on oeis4.)