Improved low-density parity-check codes using irregular graphs
DOI10.1109/18.910576zbMATH Open0999.94042OpenAlexW2137699000WikidataQ56815659 ScholiaQ56815659MaRDI QIDQ4544508FDOQ4544508
Authors: Michael Luby, Michael Mitzenmacher, M. Amin Shokrollahi, Daniel A. Spielman 
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.7296
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
belief propagationlow-density parity-check codesconcentration theoremhard-decision decodingGallagher codesirregular codes
Cited In (39)
- The typical performance of irregular low-density generator-matrix codes for lossy compression
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Title not available (Why is that?)
- Gallager codes for CDMA applications. I: Generalizations, constructions, and performance bounds
- Codes on graphs: Recent progress
- LDPC code design for nonuniform power-line channels
- Entanglement-assisted quantum error-correcting codes constructed from irregular repeat accumulate codes
- Protograph LDPC code design for asynchronous random access
- Efficient encoding of low-density parity-check codes
- Parallel versus sequential updating for belief propagation decoding
- A family of irregular LDPC codes based on optical orthogonal codes
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- LDPC Codes Based on Algebraic Graphs
- Geometric Constructions of Gallager Codes
- A recursive approach to low complexity codes
- Title not available (Why is that?)
- Finding most likely solutions
- Regular and irregular progressive edge-growth tanner graphs
- Inferring Sparse Preference Lists from Partial Information
- Performance of simple-encoding irregular LDPC codes based on sparse generator matrix
- Title not available (Why is that?)
- Parallel finite element technique using Gaussian belief propagation
- Design of capacity-approaching irregular low-density parity-check codes
- Study on the distribution law of random code structure of irregular ldpc codes and its application in eliminating short cycles
- Symmetric LDPC codes and local testing
- Low-Density Parity-Check Matrices for Coding of Correlated Sources
- Title not available (Why is that?)
- Iterative decoding of LDPC codes: some bounds and properties
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Graph Configurations and Decoding Performance
- Photonic circuits for iterative decoding of a class of low-density parity-check codes
- 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
- Expander graphs and their applications
- Theory and applications of Raptor codes
- Bounds on the performance of belief propagation decoding
- Information Geometry of Turbo and Low-Density Parity-Check Codes
- Symmetric LDPC codes and local testing
- Title not available (Why is that?)
Uses Software
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)
