Decoding of interleaved Reed-Solomon codes using improved power decoding

Sven Puchinger, Johan Rosenkilde ne Nielsen

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

187 Downloads (Pure)

Abstract

We propose a new partial decoding algorithm for m-interleaved Reed-Solomon (IRS) codes that can decode, with high probability, a random error of relative weight 1 − Rm/m+1 at all code rates R, in time polynomial in the code length n. For m > 2, this is an asymptotic improvement over the previous state-of-the-art for all rates, and the first improvement for R > 1/3 in the last 20 years. The method combines collaborative decoding of IRS codes with power decoding up to the Johnson radius.
Original languageEnglish
Title of host publicationProceedings of 2017 IEEE International Symposium on Information Theory
PublisherIEEE
Publication date2017
Pages356-60
ISBN (Print)978-1-5090-4096-4/
DOIs
Publication statusPublished - 2017
Event2017 IEEE International Symposium on Information Theory - Aachen, Germany
Duration: 25 Jun 201730 Jun 2017

Conference

Conference2017 IEEE International Symposium on Information Theory
Country/TerritoryGermany
CityAachen
Period25/06/201730/06/2017
Series2017 Ieee International Symposium on Information Theory (isit)
ISSN2157-8117

Fingerprint

Dive into the research topics of 'Decoding of interleaved Reed-Solomon codes using improved power decoding'. Together they form a unique fingerprint.

Cite this