Exponential error bounds for algebraic soft-decision decoding of Reed-Solomon codes

Authors:
N. Ratnakar;R. Koetter
Affiliations:
Coordinated Sci. Lab., Univ. of Illinois, Urbana, IL, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 2

Multiplicity assignments for algebraic soft-decoding of Reed-Solomon codes using the method of types

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Algebraic soft-decision decoding of Hermitian codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

Algebraic soft-decision decoding of Reed-Solomon codes is a promising technique for exploiting reliability information in the decoding process. While the algorithmic aspects of the decoding algorithm are reasonably well understood and, in particular, complexity is polynomially bounded in the length of the code, the performance analysis has relied almost entirely on simulation results. Analytical exponential error bounds that can be used to tightly bound the performance of Reed-Solomon codes under algebraic soft-decision decoding are presented in this paper. The analysis is used in a number of examples and several extensions and consequences of the results are presented.