|
Problemy Peredachi Informatsii, 1974, Volume 10, Issue 1, Pages 15–28
(Mi ppi1015)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Coding Theory
Decoding Complexity of Low-Density Codes For Transmission in a Channel with Erasures
V. V. Zyablov, M. S. Pinsker
Abstract:
It is proved that low density codes of length $n$ exist with a decoding that corrects all erasures up to multiplicity on with a complexity of order $n\ln n$. It is shown that the ratio of $\alpha n$ to the code distance corresponding to the Varshamov–Gilbert bound has a lower bound varying from 0.33 to 0.66 as the transmission rate is increased from 0 to 1.
Received: 28.09.1972 Revised: 20.08.1973
Citation:
V. V. Zyablov, M. S. Pinsker, “Decoding Complexity of Low-Density Codes For Transmission in a Channel with Erasures”, Probl. Peredachi Inf., 10:1 (1974), 15–28; Problems Inform. Transmission, 10:1 (1974), 10–21
Linking options:
https://www.mathnet.ru/eng/ppi1015 https://www.mathnet.ru/eng/ppi/v10/i1/p15
|
Statistics & downloads: |
Abstract page: | 746 | Full-text PDF : | 286 | First page: | 2 |
|