On the error-correcting capability of LDPC codes
From MaRDI portal
Publication:734256
DOI10.1134/S0032946008030046zbMath1173.94010OpenAlexW2001777589MaRDI QIDQ734256
D. K. Zigangirov, K. Sh. Zigangirov, Ali Emre Pusane, Daniel J. jun. Costello
Publication date: 20 October 2009
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946008030046
Related Items (3)
Analysis of the relation between properties of LDPC codes and the Tanner graph ⋮ Vectorizing computations at decoding of nonbinary codes with small density of checks ⋮ On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
Cites Work
- Unnamed Item
- Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel
- On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices
- An analysis of the block error probability performance of iterative decoding
- Distance Bounds for an Ensemble of LDPC Convolutional Codes
This page was built for publication: On the error-correcting capability of LDPC codes
