On the classification and enumeration of self-dual codes

Journal of Combinatorial Theory, Series A

Volumn 18, Issue 3, 1975, Pages 313-335

  Pless, Vera ^a   Sloane, N J A ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001055974     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/0097-3165(75)90042-4     Document Type: Article

References (44)

1. Perfect codes and the Mathieu groups
2. Coding theory and the Mathieu groups
3. Gleason's theorem on self-dual codes
4. The Möbius function and connected graphs
5. A perfect group of order 8 315 553 613 086 720 000 and the sporadic simple groups
6. A group of order 8 315 553 613 086 720 000
7. A characterization of Leech's lattice
8. Three lectures on exceptional groups
9. Combinatorial problems in the theory of graphs I
10. Enumeration of labeled graphs
11. Weight polynomials of self-dual codes and the MacWilliams identities
12. Notes on digital coding
13. Binary coding
14. The ALTRAN system for rational function manipulation—a survey
15. Minimum-distance bounds for binary linear codes
16. New binary coding results by circulants
17. Some sphere packings in higher space
18. Sphere packings and error-connecting codes
19. Generalizations of Gleason's theorem on weight enumerators of self-dual codes
20. Good self dual codes exist
21. An upper bound for self-dual codes
22. The MACSYMA system
23. Definite quadratische Formen der Dimension 24 und Diskriminante 1
24. A Note on the Mathieu groups
25. The number of isotropic subspaces in a finite geometry
26. On the uniqueness of the Golay codes
27. A classification of self-orthogonal codes over GF(2)
28. Self-dual codes over GF(q) satisfy a modified Varshamov bound
29. Some further theory of group codes
30. The uniqueness of the Nordstrom-Robinson and Golay binary codes
31. The Mathieu groups
32. 24 as a collineation group
33. Über Steinersche Systeme