Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes
From MaRDI portal
Publication:3604686
DOI10.1109/TIT.2008.917686zbMATH Open1332.94111OpenAlexW2162124494MaRDI QIDQ3604686FDOQ3604686
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
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 (1)
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)