Modifications to the Lagrange Interpolation Method of Decoding Reed Solomon Codes

Author

Gabrys, Ryan ; Wolf, Jack Keil

fYear

2008

Firstpage

459

Lastpage

463

Abstract

This paper presents several modifications of the decoding algorithm for Reed Solomon codes based upon Lagrange Interpolation. One modification reduces the average number of candidate code polynomials computed and yet still achieves maximum likelihood decoding. A second modification reduces both the average and the maximuThis paper presents several modifications of the decoding algorithm for Reed Solomon codes based upon Lagrange Interpolation. One modification reduces the average number of cThis paper presents several modifications of the decoding algorithm for Reed Solomon codes based upon Lagrange interpolation. One modification reduces the average number of candidate code polynomials computed and yet still achieves maximum likelihood decoding. A second modification reduces both the average and the maximum number of candidate code polynomials computed but is no longer maximum likelihood. Decoding beyond the guaranteed error correction capability of the code is also discussed.

Keywords

Reed-Solomon codes; interpolation; maximum likelihood decoding; polynomial approximation; Lagrange interpolation; Reed Solomon codes; candidate code polynomials; maximum likelihood decoding; Communication channels; Error correction codes; Interpolation; Lagrangian functions; Lifting equipment; Magnetic recording; Maximum likelihood decoding; Polynomials; Reed-Solomon codes; Tin;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Information Technologies, 2008. ISCIT 2008. International Symposium on

Conference_Location

Lao

Print_ISBN

978-1-4244-2335-4

Electronic_ISBN

978-1-4244-2336-1

Type

conf

DOI

10.1109/ISCIT.2008.4700234

Filename

4700234