Classification of binary/ternary one-error-correcting codes

Discrete Mathematics

Volumn 223, Issue 1-3, 2000, Pages 253-262

  Östergård, Patric R J ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Backtrack search; Code equivalence; Error correcting code; Mixed code

Indexed keywords

EID: 0345754893     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00017-0     Document Type: Article

References (5)

1. A.E. Brouwer, H.O. Hämäläinen, P.R.J. Östergård, N.J.A. Sloane, Bounds on mixed binary/ternary codes, IEEE Trans. Inform. Theory 44 (1998) 140-161.
2. B.D. McKay, Nauty user's guide (version 1.5), Technical Report TR-CS-90-02, Computer Science Department, Australian National University, 1990.
3. B.D. McKay, Autoson - a distributed batch system for UNIX workstation networks (version 1.3), Technical Report TR-CS-96-03, Computer Science Department, Australian National University, 1996.
4. B.D. McKay, Isomorph-free exhaustive generation, J. Algorithms 26 (1998) 306-324.
5. P.R.J. Östergård, T. Baicheva, E. Kolev, Optimal binary one-error-correcting codes of length 10 have 72 codewords, IEEE Trans. Inform. Theory 45 (1999) 1229-1231.