RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1975 Volume 11, Issue 1, Pages 23–36 (Mi ppi1568)

This article is cited in 21 papers

Information Theory

Estimation of the error-correction complexity for Gallager low-density codes

V. V. Zyablov, M. S. Pinsker


Abstract: 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.

UDC: 621.391.15

Received: 05.09.1973


 English version:
Problems of Information Transmission, 1975, 11:1, 18–28

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025