This article is cited in 3 papers

Coding Theory

Decoding of Low-Density Codes with Parity-Check Matrices Composed of Permutation Matrices, Used for Transmission over an Erasure Channel

D. K. Zinangirov^a, K. Sh. Zigangirov

^a Institute for Information Transmission Problems, Russian Academy of Sciences

Abstract: A lower bound for the number of iteratively correctable erasures is given, with application to the ensemble of LDPC codes with parity-check matrices composed of permutation matrices [1]. We assume that the Zyablov–Pinsker iterative decoding algorithm [2] is used. Its complexity is $O(Nlog N)$, where $N$ is the block length.

UDC: 621.391.15

Received: 29.09.2005
Revised: 14.11.2005

 English version: Problems of Information Transmission, 2006, 42:2, 106–113

Bibliographic databases:

• 
•