Optimal weight assignment for algebraic soft decoding

Author

Koetter, Ralf ; Vardy, Alexander

Author_Institution

Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA

Volume

1

fYear

2001

fDate

4-7 Nov. 2001

Firstpage

280

Abstract

Polynomial-time soft decoding for Reed-Solomon codes is investigated in the context of interpolation based decoding algorithms. Two criteria for soft decoding are studied. The first criterion is motivated by the probability of decoding failure while the second criterion is chosen to maximize the error correction capability of the code for a given additive cost function. Solutions that optimize the respective objective function are given to both problems.

Keywords

Golay codes; Reed-Solomon codes; algebraic codes; binary codes; concatenated codes; decoding; error correction codes; geometric codes; interpolation; optimisation; probability; Golay code; Reed-Solomon codes; additive cost function; algebraic code; algebraic decoding; binary code; concatenated code; error-correction capability; geometric code; interpolation; objective function; polynomial-time decoding; soft decoding; Cost function; Decoding; Error correction codes; Galois fields; H infinity control; Hamming distance; Interpolation; Polynomials; Reed-Solomon codes; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 2001. Conference Record of the Thirty-Fifth Asilomar Conference on

Conference_Location

Pacific Grove, CA, USA

ISSN

1058-6393

Print_ISBN

0-7803-7147-X

Type

conf

DOI

10.1109/ACSSC.2001.986920

Filename

986920