Stopping Sets for MDS-based Product Codes Conference Paper

abstract

• 2016 IEEE. 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.

name of conference

• 2016 IEEE International Symposium on Information Theory (ISIT)

authors

• Boutros, Joseph

published proceedings

• 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY

author list (cited authors)

• Jardel, F., Boutros, J. J., & Sarkiss, M.

citation count

• 1

complete list of authors

• Jardel, Fanny||Boutros, Joseph J||Sarkiss, Mireille

publication date

• July 2016

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE International Symposium on Information Theory - Proceedings  Journal

Digital Object Identifier (DOI)

• 10.1109/isit.2016.7541597

International Standard Book Number (ISBN) 13

• 9781509018062

start page

• 1740

end page

• 1744

volume

• 2016-August

URL

• http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7532279