Zyablov, V. V.; Pinsker, M. S. Complexity bounds of error correction for low-density Gallager codes. (Russian) Zbl 0358.94017 Probl. Peredachi Inf. 11, No. 1, 23-26 (1975). Summary: It is shown that among the Gallager low-density binary codes there are codes with decoding for the correction of all errors up to multiplicity \(\alpha n\) and with decoding complexity of order \(n\log n\), where \(n\) is the code length and \(\alpha\) is a positive number. Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 12 Documents MSC: 94B60 Other types of codes 94B65 Bounds on codes PDF BibTeX XML Cite \textit{V. V. Zyablov} and \textit{M. S. Pinsker}, Probl. Peredachi Inf. 11, No. 1, 23--26 (1975; Zbl 0358.94017) Full Text: MNR