Stopping sets for MDS-based product codes - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Stopping sets for MDS-based product codes

(1) , (2) , (3)
1
2
3

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.
Not file

Dates and versions

cea-01840415 , version 1 (16-07-2018)

Identifiers

Cite

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⟩
26 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More