Improved low-density parity-check codes using irregular graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1775410
- Good error-correcting codes based on very sparse matrices
- Design of capacity-approaching irregular low-density parity-check codes
- Efficient encoding of low-density parity-check codes
- The capacity of low-density parity-check codes under message-passing decoding
Cited in
(47)- Parallel versus sequential updating for belief propagation decoding
- Improved decoding and error floor analysis of staircase codes
- Protograph LDPC code design for asynchronous random access
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- Study on the distribution law of random code structure of irregular ldpc codes and its application in eliminating short cycles
- Gallager codes for CDMA applications. I: Generalizations, constructions, and performance bounds
- scientific article; zbMATH DE number 1714649 (Why is no real title available?)
- scientific article; zbMATH DE number 1714651 (Why is no real title available?)
- Performance of low density parity check codes as a function of actual and assumed noise levels
- Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes
- Parallel finite element technique using Gaussian belief propagation
- Performance of simple-encoding irregular LDPC codes based on sparse generator matrix
- Lowering the error floor of Gallager codes: a statistical-mechanical view
- A family of irregular LDPC codes based on optical orthogonal codes
- Photonic circuits for iterative decoding of a class of low-density parity-check codes
- Entanglement-assisted quantum error-correcting codes constructed from irregular repeat accumulate codes
- Geometric constructions of Gallager codes
- Expander graphs and their applications
- Regular and irregular progressive edge-growth tanner graphs
- Information Geometry of Turbo and Low-Density Parity-Check Codes
- Low-Density Parity-Check Matrices for Coding of Correlated Sources
- The typical performance of irregular low-density generator-matrix codes for lossy compression
- A recursive approach to low complexity codes
- scientific article; zbMATH DE number 1775410 (Why is no real title available?)
- Design of capacity-approaching irregular low-density parity-check codes
- Efficient encoding of low-density parity-check codes
- Bounds on the performance of belief propagation decoding
- Graph Configurations and Decoding Performance
- Theory and applications of Raptor codes
- Good error-correcting codes based on very sparse matrices
- Symmetric LDPC codes and local testing
- Inferring Sparse Preference Lists from Partial Information
- Code optimization, frozen glassy phase and improved decoding algorithms for low-density parity-check codes
- Symmetric LDPC codes and local testing
- Graph based linear error correcting codes
- LDPC codes based on algebraic graphs
- scientific article; zbMATH DE number 5260071 (Why is no real title available?)
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Codes on graphs: Recent progress
- Iterative decoding of LDPC codes: some bounds and properties
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Linear-time decoding from a constant fraction of errors for irregular expander codes
- Knot theory and error-correcting codes
- High-girth near-Ramanujan graphs with lossy vertex expansion
- Finding most likely solutions
- LDPC code design for nonuniform power-line channels
This page was built for publication: Improved low-density parity-check codes using irregular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544508)
