|
Search: id:A106167
|
|
|
| A106167 |
|
Number of (indecomposable or decomposable) binary self-dual codes (singly- or doubly-even) of length 2n and minimal distance exactly 4. |
|
+0
6
|
|
| 0, 0, 0, 0, 1, 0, 1, 1, 3, 2, 7, 8, 28, 47, 155, 457, 2482, 19914
(list; graph; listen)
|
|
|
OFFSET
|
1,9
|
|
|
REFERENCES
|
R. T. Bilous, Enumeration of binary self-dual codes of length 34, Preprint, 2005.
R. T. Bilous and G. H. J. van Rees, An enumeration of binary self-dual codes of length 32, Designs, Codes Crypt., 26 (2002), 61-86.
J. H. Conway and V. S. Pless, On the enumeration of self-dual codes, J. Comb. Theory, A28 (1980), 26-53.
V. S. Pless, The children of the (32,16) doubly even codes, IEEE Trans. Inform. Theory, 24 (1978), 738-746.
|
|
LINKS
|
G. Nebe, E. M. Rains and N. J. A. Sloane, Self-Dual Codes and Invariant Theory, Springer, Berlin, 2006.
J. H. Conway, V. Pless and N. J. A. Sloane, The Binary Self-Dual Codes of Length Up to 32: A Revised Enumeration, J. Comb. Theory, A28 (1980), 26-53 (Abstract, pdf, ps, Table A, Table D).
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
|
Sequence in context: A073293 A021309 A054170 this_sequence A091913 A026136 A026172
Adjacent sequences: A106164 A106165 A106166 this_sequence A106168 A106169 A106170
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, May 09 2005
|
|
|
Search completed in 0.002 seconds
|
