Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes

DOI10.1109/TIT.2008.917686MaRDI QIDQ3604686zbMATH OpenOpenAlexFDO

Authors Eirik Rosnes

Publication date 24 February 2009

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

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

Mathematics Subject Classification ID

Decoding (94B35) Other types of codes (94B60)

Recommendations

• On the minimum stopping sets of product codes
• Stopping sets of binary parity-check matrices with constant weight columns and stopping redundancy of the associated codes
• Decoding of blockwise-burst errors in row-cyclic array codes.
• Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes
• Stopping Set Distribution of LDPC Code Ensembles
• On hard-decision decoding of product codes
• Decoding Reed-Muller codes over product sets
• Decoding Reed-Muller codes over product sets
• Stopping Set Distributions of Some Reed–Muller Codes

Cited in

(3)

• High stopping-distance LDPC product codes based on Hamming and finite geometry codes.
• On the minimum stopping sets of product codes
• Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators

This page was built for publication: Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes

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