Properties of Optimum Binary Message-Passing Decoders

DOI10.1109/TIT.2005.855611MaRDI QIDQ3546486zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Masoud Ardakani, Frank R. Kschischang

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/tit.2005.855611

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• Bounds on the performance of belief propagation decoding
• Iterative decoding of LDPC codes: some bounds and properties
• The capacity of low-density parity-check codes under message-passing decoding
• Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
• Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A

Cited in

(4)

• Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A
• Bounds on the performance of belief propagation decoding
• Joint message-passing decoding of LDPC codes and partial-response channels
• Message passing algorithms and improved LP decoding

This page was built for publication: Properties of Optimum Binary Message-Passing Decoders

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