Stopping sets for MDS-based product codes

F. Jardel (1) , J.J. Boutros (2) , M. Sarkiss (3)

1 Télécom ParisTech
2 Texas A&M University at Qatar
3 DIASI - Département Intelligence Ambiante et Systèmes Interactifs

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.

Keywords: Codes (symbols); Information theory; Inventory control; Maximum likelihood; Coding rate; Erasure channels; Maximum likelihood decoding; Numerical results; Product code; Row-column; Stopping set; Union bounds; Iterative decoding

Domains: Engineering Sciences [physics]

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⟩