2005Unpublished venueRequires access

Limits to list decoding Reed-Solomon codes

Venkatesan Guruswami, Atri Rudra

Open publisher page 14 citations

Abstract

In this paper, we prove the following two results that expose some combinatorial limitations to list decoding Reed-Solomon codes.

About this research paper

What this paper is about

In this paper, we prove the following two results that expose some combinatorial limitations to list decoding Reed-Solomon codes.

Why it matters

OpenAlex reports 14 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

In this paper, we prove the following two results that expose some combinatorial limitations to list decoding Reed-Solomon codes.

Key concepts: Reed–Solomon error correction, List decoding, Decoding methods, Computer science, Berlekamp–Welch algorithm, Concatenated error correction code, Sequential decoding, Reed–Muller code

Related papers

Back to paper searchBrowse research topicsOriginal source
Limits to list decoding Reed-Solomon codes — Research Paper | ScholarLens