On the minimal redundancy of binary error-correcting codes

Information and Control

Volumn 28, Issue 4, 1975, Pages 268-291

  Levenshtein, V I ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0016543295     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(75)90300-9     Document Type: Article

References (11)

1. New upper bounds for error-correcting codes
2. A Comparison of Signalling Alphabets
3. A new upper bound for error-correcting codes
4. A class of low-rate nonlinear binary codes
5. Application of Hadamard matrices to a problem of coding theory
6. On upper bounds for codes with codewords of fixed weight
7. On the autocorrelation of sequences
8. On the density of sphere packings on the surface of an given minimum distance
9. Upper bounds for the cardinality of a binary code with a given minimum distance
10. Upper bounds for the cardinality of a binary code with a given minimum distance