Expander graph arguments for message-passing algorithms

DOI10.1109/18.910588MaRDI QIDQ4544520zbMATH OpenOpenAlexFDO

Authors David Burshtein, Gadi Miller

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/24ca8274cf5b92f266dc6f782af9839f345f7168

zbMATH Keywords

belief propagationexpander graphmessage-passing algorithmiterative decodinglow-density parity-check codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Decoding (94B35) Other types of codes (94B60)

Recommendations

• Iterative decoding of LDPC codes: some bounds and properties
• Expander codes
• Linear time decoding of regular expander codes
• On expander codes
• scientific article; zbMATH DE number 5010757

Cited in

(3)

• scientific article; zbMATH DE number 1693483 (Why is no real title available?)
• Iterative decoding of LDPC codes: some bounds and properties
• Photonic circuits for iterative decoding of a class of low-density parity-check codes

This page was built for publication: Expander graph arguments for message-passing algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544520)