Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach

DOI10.1109/TIT.2005.853321MaRDI QIDQ3547580zbMATH OpenFDO

Authors S. Sankaranarayanan, Bane Vasić

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.853321

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Linear codes (general theory) (94B05)

Recommendations

• Iterative decoding of LDPC codes: some bounds and properties
• scientific article; zbMATH DE number 1714662
• scientific article; zbMATH DE number 2077096
• Algebraic coding for iterative decoding
• Which codes have cycle-free Tanner graphs?

Cited in

(10)

• Codes with girth 8 Tanner graph representation
• Iterative decoding of parallel concatenated block codes and coset based MAP decoding algorithm for F24 code
• Iterative decoding of binary block and convolutional codes
• An Analysis of the Orthogonality Structures of Convolutional Codes for Iterative Decoding
• Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations
• On a necessary condition for L-step orthogonalization of linear codes and its applications
• scientific article; zbMATH DE number 1424165 (Why is no real title available?)
• Pseudocodeword-free criterion for codes with cycle-free Tanner graph
• Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
• On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size

This page was built for publication: Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach

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