Decoding of interleaved Reed-Solomon codes using improved power decoding

Sven Puchinger, Johan Rosenkilde Né Nielsen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

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 publication2017 IEEE International Symposium on Information Theory, ISIT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages356-360
Number of pages5
ISBN (Electronic)9781509040964
DOIs
StatePublished - 9 Aug 2017
Externally publishedYes
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: 25 Jun 201730 Jun 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/TerritoryGermany
CityAachen
Period25/06/1730/06/17

Keywords

  • Collaborative Decoding
  • Interleaved Reed-Solomon Codes
  • Power Decoding with Multiplicities

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