Iterative decoding of one-step majority logic decodable codes based on belief propagation

DOI10.1109/26.848552MaRDI QIDQ2732997zbMATH OpenOpenAlexFDO

Authors Rainer Lucas, Marc Fossorier, Yu Kou, Shu Lin

Publication date 2 December 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

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

zbMATH Keywords

belief propagation algorithmdecodingiterative decodingmajority-logic decodingsoft-decision decoding

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• Bounds on the performance of belief propagation decoding
• On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
• Iterative decoding of generalized parallel concatenated OSMLD codes
• Iterative decoding of LDPC codes: some bounds and properties
• Improved BP-based decoding algorithms integrated with GA for LDPC codes

Cited in

(5)

• Parallel versus sequential updating for belief propagation decoding
• Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes
• scientific article; zbMATH DE number 4160657 (Why is no real title available?)
• scientific article; zbMATH DE number 1928620 (Why is no real title available?)
• Regular LDPC codes from semipartial geometries

This page was built for publication: Iterative decoding of one-step majority logic decodable codes based on belief propagation

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