|
Problemy Peredachi Informatsii, 1995, Volume 31, Issue 2, Pages 76–83
(Mi ppi277)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
Asymptotically Optimal Binary Codes of Polynomial Complexity Correcting Localized Errors
R. Ahlswede, L. A. Bassalygo, M. S. Pinsker
Abstract:
The asymptotically optimal transmission rate of binary codes correcting localized errors is known when the number of errors grows linearly in the code length. Here we prove that this rate can be attained by codes with polynomial complexity of encoding, decoding, and code construction.
Received: 22.03.1994
Citation:
R. Ahlswede, L. A. Bassalygo, M. S. Pinsker, “Asymptotically Optimal Binary Codes of Polynomial Complexity Correcting Localized Errors”, Probl. Peredachi Inf., 31:2 (1995), 76–83; Problems Inform. Transmission, 31:2 (1995), 162–168
Linking options:
https://www.mathnet.ru/eng/ppi277 https://www.mathnet.ru/eng/ppi/v31/i2/p76
|
Statistics & downloads: |
Abstract page: | 318 | Full-text PDF : | 104 | First page: | 2 |
|