A Chernoff type error bound for algebraic soft-decision decoding of Reed Solomon codes

Author

Ratnakar, Niranjan ; Koetter, Ralf

Author_Institution

Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA

Volume

1

fYear

2002

fDate

3-6 Nov. 2002

Firstpage

155

Abstract

We present exponential upper bounds on the performance of algebraic soft-decision decoding algorithm in the decoding of Reed-Solomon codes for a symmetric channel. The symmetric channels are useful for computing the performance of the algebraic soft-decision decoding algorithm in regimes where the probability of error is low. In such regimes, these bounds are of particular interest since it is impractical to run simulations. The bounds are Chernoff-type error bounds.

Keywords

Reed-Solomon codes; algebraic codes; channel coding; decoding; error correction codes; error statistics; matrix algebra; Chernoff type error bounds; Reed Solomon codes; algebraic soft-decision decoding; decoding algorithm; error probability; error-control codes; multiplicity matrix; symmetrical channels; Algorithm design and analysis; Analytical models; Decoding; Galois fields; H infinity control; Performance analysis; Polynomials; Reed-Solomon codes; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 2002. Conference Record of the Thirty-Sixth Asilomar Conference on

Conference_Location

Pacific Grove, CA, USA

ISSN

1058-6393

Print_ISBN

0-7803-7576-9

Type

conf

DOI

10.1109/ACSSC.2002.1197167

Filename

1197167