On the size of optimal binary codes of length 9 and covering radius 1

IEEE Transactions on Information Theory

Volumn 47, Issue 6, 2001, Pages 2556-2557

  Östergård, Patric R J ^a,b   Blass, Uri ^c  

^a IEEE   (Finland)

^b AALTO UNIVERSITY   (Finland)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Code equivalence; Covering code; Linear programming; Nonlinear code; Weighted covering

Indexed keywords

CODE EQUIVALENCE; NONLINEAR CODE; WEIGHTED COVERING;

ALGORITHMS; ENCODING (SYMBOLS); EQUIVALENCE CLASSES; LINEAR PROGRAMMING; PROBLEM SOLVING;

BINARY CODES;

EID: 0035442599     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.945268     Document Type: Letter

References (13)

1. Several new lower bounds on the size of codes with covering radius one
2. Further results on the covering radius of codes
3. Bounds for binary codes that are multiple coverings of the farthest-off points
4. The football pool problem for 5 matches
5. A (9, 56) 1 binary code does not exist
6. Factoring polynomials with rational coefficients
7. Isomorph-free exhaustive generation
8. Optimal binary one-error-correcting codes of length 10 have 72 codewords
9. A new lower bound for the football pool problem for 6 matches
10. Classification of binary covering codes
11. Intersection inequalities for the covering problem