Folded Reed–Solomon code

Known as: Folded Reed-Solomon Codes, Folded Reed-Solomon code, Folded Reed–Solomon codes 
In coding theory, folded Reed–Solomon codes are like Reed–Solomon codes, which are obtained by mapping Reed–Solomon codewords over a larger alphabet… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
A fundamental fact about polynomial interpolation is that k evaluations of a degree-(k-1) polynomial f are sufficient to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 5
Is this relevant?
2014
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
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
A concatenated code construction based on folded Reed-Solomon codes and short inner linear block codes is proposed. A… (More)
  • figure 1
Is this relevant?
2006
2006
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
New high-speed VLSI architectures for decoding Reed–Solomon codes with the Berlekamp–Massey algorithm are presented in this paper… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
of Reed-Solomon Codes Ralf Koetter Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana, IL 61801, U… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
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
Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem… (More)
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
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?