On binary/ternary error-correcting codes with minimum distance 4

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1719, Issue , 1999, Pages 472-481

  Östergård, Patric R J ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BINS; ERRORS;

CARDINALITIES; COMPUTER-AIDED; ERROR CORRECTING CODE; MINIMUM DISTANCE; SHORT CODES;

CODES (SYMBOLS);

EID: 84957677332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46796-3_45     Document Type: Conference Paper

References (8)

1. Brouwer, A.E., Hämäläinen, H.O., Ostergard, P.R.J., Sloane, N.J.A.: Bounds on mixed binary/ternary codes. IEEE Trans. Inform. Theory 44 (1998) 140-161
2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York (1979)
3. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North- Holland, Amsterdam (1977)
4. McKay, B.D.: nauty user's guide (version 1.5). Tech. Rep. TR-CS-90-02, Computer Science Department, Australian National University (1990)
5. McKay, B.D.: autoson - a distributed batch system for UNIX workstation networks (version 1.3). Tech. Rep. TR-CS-96-03, Computer Science Department, Australian National University (1996)
6. Ostergard, P.R.J.: Classification of small binary/ternary one-error-correcting codes. (submitted for publication)
7. Ostergard, P.R.J., Baicheva, T., Kolev, E.: Optimal binary one-error-correcting codes of length 10 have 72 codewords. IEEE Trans. Inform. Theory 45 (1999) 1229-1231
8. 3(n,d). Discrete Appl. Math. 45 (1993) 71-87