An enumeration of binary self-dual codes of length 32

Designs, Codes, and Cryptography

Volumn 26, Issue 1-3, 2002, Pages 61-86

  Bilous, R T ^a   Van Rees, G H J ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Algorithm; Automorphism group; Binary code; Canonical form; Enumeration; Equivalence; Linear code; Orthogonal; Recursive; Self dual; Weight distribution

Indexed keywords

ALGORITHMS; BINARY CODES; BINS; CODES (SYMBOLS);

AUTOMORPHISM GROUPS; CANONICAL FORM; ENUMERATION; EQUIVALENCE; LINEAR CODES; ORTHOGONAL; RECURSIVE; SELF-DUAL; WEIGHT DISTRIBUTIONS;

C (PROGRAMMING LANGUAGE);

EID: 31244438540     PISSN: 09251022     EISSN: 15737586     Source Type: Journal    
DOI: 10.1023/A:1016544907275     Document Type: Article

References (8)

1. R. T. Bilous, A Recursive Enumeration of the Inequivalent Binary (2k, k) Self-Dual Codes, for 2k ≤ 32, University of Manitoba Master’s Thesis, Dept. of Computer Science (1998).
2. R. T. Bilous, http://www.cs.umanitoba.ca/˜umbilou1/SelfDualCodes/toc.html (1998).
3. J. H. Conway and V. Pless, On the enumeration of self-dual codes, J. Combin Theory Ser. A, Vol. 28 (1980) pp. 26-53.
4. J. H. Conway and N. J. A. Sloane, A new upper bound on the minimal distance of self-dual codes, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 1319-1333.
5. J. H. Conway, V. Pless and N. J. A. Sloane, The binary self-dual codes of length up to 32: a revised enumeration, IEEE Trans. Inform. Theory, Vol. 36 (1990) pp. 183-195.
6. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, North-Holland, Amsterdam (1977).
7. V. Pless, A classification of self-orthogonal codes over GF(2), Discrete Math., Vol. 3 (1972) pp. 209-246.
8. V. Pless and N. J. A. Sloane, On the classification and enumeration of self-dual codes, J. Combin. Theory Ser. A, Vol. 18 (1975) pp. 313-335.