Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066012
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066012 Highest minimal Lee distance of any Type 4^Z self-dual code of length n over Z/4Z which does not have all Euclidean norms divisible by 8, that is, is strictly Type I. Compare A105681. +0
9
2, 2, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 4, 6, 6, 8, 6, 8, 6, 8, 8, 8, 10, 10 (list; graph; listen)
OFFSET

1,1

LINKS

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

S. T. Dougherty, M. Harada and P. Sole', Shadow Codes over Z_4, Finite Fields Applic., 7 (2001), 507-529.

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

Cf. A066013 for number of codes. See also A066014-A066017.

Sequence in context: A161841 A152674 A072056 this_sequence A063375 A064129 A005137

Adjacent sequences: A066009 A066010 A066011 this_sequence A066013 A066014 A066015

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Dec 11 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research