Expander graph arguments for message-passing algorithms

DOI10.1109/18.910588zbMath1003.94042OpenAlexW2141042196MaRDI QIDQ4544520

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

low-density parity-check codesbelief propagationexpander graphmessage-passing algorithmiterative decoding

Mathematics Subject Classification ID

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

Related Items (2)

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