An algebraic description of iterative decoding schemes

MaRDI QIDQ2776531zbMATH OpenFDO

Authors Elke Offer, Emina Soljanin

Publication date 4 November 2002

zbMATH Keywords

bit decodingiterative decodingmessage passingsoft-output decodingsuboptimal bit decoders

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Iterative decoding of binary block and convolutional codes
• Algebraic coding for iterative decoding
• Bit-optimal decoding of codes whose Tanner graphs are trees
• Iterative decoding of LDPC codes: some bounds and properties
• LDPC codes: A group algebra formulation

Cited in

(7)

• Bit-optimal decoding of codes whose Tanner graphs are trees
• A new algebraic algorithm for generating the transfer function of a trellis encoder
• LDPC codes: A group algebra formulation
• An introduction to the analysis of iterative coding systems
• Algebraic coding for iterative decoding
• A Unified View on Known Algebraic Decoding Algorithms and New Decoding Concepts
• Iterative Channel Decoding of FEC-Based Multiple-Description Codes

This page was built for publication: An algebraic description of iterative decoding schemes

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