Analysis of Iterated Hard Decision Decoding of Product Codes with Reed-Solomon Component Codes

Jørn Justesen (Invited author), Tom Høholdt (Invited author)

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

426 Downloads (Pure)

Abstract

Products of Reed-Solomon codes are important in applications because they offer a combination of large blocks, low decoding complexity, and good performance. A recent result on random graphs can be used to show that with high probability a large number of errors can be corrected by iterating minimum distance decoding. We present an analysis related to density evolution which gives the exact asymptotic value of the decoding threshold and also provides a closed form approximation to the distribution of errors in each step of the decoding of finite length codes.
Original languageEnglish
Title of host publicationIEEE Information Theory Workshop, 2007. ITW '07.
Place of PublicationLake Tahoe
PublisherIEEE
Publication date2007
ISBN (Print)1-4244-1564-0
DOIs
Publication statusPublished - 2007
EventIEEE Information Theory Workshop, 2007. - Tahoe City, CA
Duration: 1 Jan 2007 → …

Conference

ConferenceIEEE Information Theory Workshop, 2007.
CityTahoe City, CA
Period01/01/2007 → …

Bibliographical note

Copyright: 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Fingerprint Dive into the research topics of 'Analysis of Iterated Hard Decision Decoding of Product Codes with Reed-Solomon Component Codes'. Together they form a unique fingerprint.

Cite this