Analysis of the relation between properties of LDPC codes and the Tanner graph
From MaRDI portal
Recommendations
Cites work
- A recursive approach to low complexity codes
- Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes
- Erasure correction by low-density codes
- scientific article; zbMATH DE number 3559420 (Why is no real title available?)
- Mathematical analysis of an iterative decoding algorithm for low-density codes
- On the error-correcting capability of LDPC codes
- On the Number of Errors Correctable with Codes on Graphs
Cited in
(9)- Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
- Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers
- Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes
- Graph Configurations and Decoding Performance
- scientific article; zbMATH DE number 750223 (Why is no real title available?)
- Vectorizing computations at decoding of nonbinary codes with small density of checks
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Effective error floor estimation based on importance sampling with the uniform distribution
This page was built for publication: Analysis of the relation between properties of LDPC codes and the Tanner graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945141)