|
Problemy Peredachi Informatsii, 1974, Volume 10, Issue 2, Pages 26–42
(Mi ppi1027)
|
|
|
|
Coding Theory
Minimum Redundancy of Binary Error-Correcting Codes
V. I. Levenshtein
Abstract:
New lower bounds are obtained for the redundancy of arbitrary and equilibrium binary codes correcting a fixed proportion of errors.
Received: 19.12.1973
Citation:
V. I. Levenshtein, “Minimum Redundancy of Binary Error-Correcting Codes”, Probl. Peredachi Inf., 10:2 (1974), 26–42; Problems Inform. Transmission, 10:2 (1974), 110–123
Linking options:
https://www.mathnet.ru/eng/ppi1027 https://www.mathnet.ru/eng/ppi/v10/i2/p26
|
Statistics & downloads: |
Abstract page: | 469 | Full-text PDF : | 229 |
|