Stopping sets for MDS-based product codes

Abstract : Stopping sets for MDS-based product codes under iterative row-column algebraic decoding are analyzed in this paper. A union bound to the performance of iterative decoding is established for the independent symbol erasure channel. This bound is tight at low and very low error rates. We also proved that the performance of iterative decoding reaches the performance of Maximum-Likelihood decoding at vanishing channel erasure probability. Numerical results are shown for product codes at different coding rates.
Document type :
Conference papers
Complete list of metadatas

https://hal-cea.archives-ouvertes.fr/cea-01840415
Contributor : Léna Le Roy <>
Submitted on : Monday, July 16, 2018 - 2:06:34 PM
Last modification on : Wednesday, January 23, 2019 - 2:39:24 PM

Identifiers

Collections

Citation

F. Jardel, J.J. Boutros, M. Sarkiss. Stopping sets for MDS-based product codes. 2016 IEEE International Symposium on Information Theory (ISIT), Jul 2016, Barcelona, Spain. pp.1740-1744, ⟨10.1109/ISIT.2016.7541597⟩. ⟨cea-01840415⟩

Share

Metrics

Record views

37