Improved low-density parity-check codes using irregular graphs
From MaRDI portal
Publication:4544508
DOI10.1109/18.910576zbMath0999.94042OpenAlexW2137699000WikidataQ56815659 ScholiaQ56815659MaRDI QIDQ4544508
Michael Luby, Mohammad Amin Shokrollahi, Daniel A. Spielman, Michael Mitzenmacher
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
low-density parity-check codesbelief propagationconcentration theoremhard-decision decodingGallagher codesirregular codes
Related Items
LDPC code design for nonuniform power-line channels, Geometric Constructions of Gallager Codes, Parallel finite element technique using Gaussian belief propagation, Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error, Expander graphs and their applications, Parallel versus sequential updating for belief propagation decoding, Inferring Sparse Preference Lists from Partial Information, Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering, LDPC Codes Based on Algebraic Graphs, Symmetric LDPC codes and local testing, Protograph LDPC code design for asynchronous random access, Symmetric LDPC Codes and Local Testing, Codes on graphs: Recent progress, Iterative decoding of LDPC codes: some bounds and properties, Theory and applications of Raptor codes, Finding most likely solutions, 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
Uses Software
