Adaptive single-trial error/erasure decoding of Reed-Solomon codes

Christian Senger, Vladimir R. Sidorenko, Steffen Schober, Martin Bossert, Victor V. Zyablov

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

1 Citation (Scopus)

Abstract

Algebraic decoding algorithms are commonly applied for the decoding of Reed-Solomon codes. Their main advantages are low computational complexity and predictable decoding capabilities. Many algorithms can be extended for correction of both errors and erasures. This enables the decoder to exploit binary quantized reliability information obtained from the transmission channel: Received symbols with high reliability are forwarded to the decoding algorithm while symbols with low reliability are erased. In this paper we investigate adaptive single-trial error/erasure decoding of Reed-Solomon codes, i.e. we derive an adaptive erasing strategy which minimizes the residual codeword error probability after decoding. Our result is applicable to any error/erasure decoding algorithm as long as its decoding capabilities can be expressed by a decoder capability function. Examples are Bounded Minimum Distance decoding with the Berlekamp-Massey- or the Sugiyama algorithms and the Guruswami-Sudan list decoder.

Original languageEnglish
Title of host publication12th Canadian Workshop on Information Theory, CWIT 2011
Pages47-51
Number of pages5
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event12th Canadian Workshop on Information Theory, CWIT 2011 - Kelowna, BC, Canada
Duration: 17 May 201120 May 2011

Publication series

Name12th Canadian Workshop on Information Theory, CWIT 2011

Conference

Conference12th Canadian Workshop on Information Theory, CWIT 2011
Country/TerritoryCanada
CityKelowna, BC
Period17/05/1120/05/11

Fingerprint

Dive into the research topics of 'Adaptive single-trial error/erasure decoding of Reed-Solomon codes'. Together they form a unique fingerprint.

Cite this