2013•Unpublished venueRequires access

A list decoding algorithm for practical reed-solomon codes

S. I. Egorov

Abstract

A novel algorithm is proposed for decoding of Reed-Solomon codes beyond half the minimum distance. This algorithm is based on analytical continuation of the Berlekamp-Massey algorithm through additional iterations. It is shown that the proposed algorithm allows to correct more errors compared to Guruswami-Sudan (GS) algorithm. Also computational complexity of the new algorithm is less than GS algorithm one if number of extra correcting errors (τ) is small. Further complexity reduction is achieved by use of soft decisions. The coding gain of the proposed algorithm is shown for some practical codes.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Berlekamp–Welch algorithm, BCJR algorithm, List decoding, Algorithm, Reed–Solomon error correction, Decoding methods, Computer science, Sequential decoding