On the error-correcting capability of LDPC codes
From MaRDI portal
Publication:734256
DOI10.1134/S0032946008030046zbMATH Open1173.94010OpenAlexW2001777589MaRDI QIDQ734256FDOQ734256
Authors: Kamil S. Zigangirov, D. K. 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
Recommendations
- Low-complexity error correction of Hamming-code-based LDPC codes
- Error-Correction Capability of Column-Weight-Three LDPC Codes
- On the Dynamics of the Error Floor Behavior in (Regular) LDPC Codes
- Performance of LDPC Codes Under Faulty Iterative Decoding
- Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes
- scientific article; zbMATH DE number 4121930
- Enhancement of unequal error protection properties of LDPC codes
- Upper bounds on the rate of LDPC codes
- Error-Correction Capability of Binary Linear Codes
- Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
Cites Work
- Title not available (Why is that?)
- 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
- Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel
- Distance Bounds for an Ensemble of LDPC Convolutional Codes
Cited In (17)
- Title not available (Why is that?)
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
- Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes
- A fast BER evaluation method for LDGM codes
- Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel
- Low-complexity error correction of Hamming-code-based LDPC codes
- Upper bounds on the rate of LDPC codes
- Low-density parity-check codes achieve list-decoding capacity
- Random-error correcting capability of the Iwadare codes and the Berlekamp-Preparata-Massey codes (Corresp.)
- Analysis of the relation between properties of LDPC codes and the Tanner graph
- Enhancement of unequal error protection properties of LDPC codes
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm
- Finite-Dimensional Bounds on ${\BBZ}_m$ and Binary LDPC Codes With Belief Propagation Decoders
- An introduction to LDPC codes
- Vectorizing computations at decoding of nonbinary codes with small density of checks
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
This page was built for publication: On the error-correcting capability of LDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734256)
