# Folded Reed–Solomon code

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2016

Highly Cited

2016

- IEEE Transactions on Information Theory
- 2016

A fundamental fact about polynomial interpolation is that k evaluations of a degree-(k-1) polynomial f are sufficient to… (More)

Is this relevant?

2014

2014

- ICMCTA
- 2014

Notation and Definitions: Let... • Fq denote a finite field of order q, • F∗ q := Fq\{0} be the multiplicative group with… (More)

Is this relevant?

2011

2011

- IEEE 26th Annual Conference on Computational…
- 2011

Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction… (More)

Is this relevant?

2011

2011

- IEEE International Symposium on Information…
- 2011

A concatenated code construction based on folded Reed-Solomon codes and short inner linear block codes is proposed. A… (More)

Is this relevant?

2006

2006

- 2006

We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- IEEE Trans. VLSI Syst.
- 2001

New high-speed VLSI architectures for decoding Reed–Solomon codes with the Berlekamp–Massey algorithm are presented in this paper… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- IEEE Trans. Information Theory
- 2000

of Reed-Solomon Codes Ralf Koetter Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana, IL 61801, U… (More)

Is this relevant?

1999

1999

- AAECC
- 1999

During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- IEEE Trans. Information Theory
- 1998

Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem… (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- J. Complexity
- 1997

We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F × F (where F is a field) and… (More)

Is this relevant?