Reed–Solomon error correction

Known as: Reed-Solomon erasure codes, RS, Reed–Solomon code 
Reed–Solomon codes are a group of error-correcting codes that were introduced by Irving S. Reed and Gustave Solomon in 1960.They have many… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1938-2017
020040019382016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
he main aim of this paper is to give some essential background to the theory of Reed Solomon codes and the previous survey… (More)
Is this relevant?
2013
2013
This paper presents the architecture design of the reconfigurable Reed Solomon (RS) error correction codec that supports ten RS… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2013
2013
This document describes a fully-specified simple Forward Error Correction (FEC) scheme for Reed-Solomon codes over the finite… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 7
Is this relevant?
2012
2012
This paper proposes a new watermarking scheme for embedding phone numbers into colour images captured by a mobile phone camera… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2009
Highly Cited
2009
A polynomial-time soft-decision decoding algorithm for Reed–Solomon codes is developed. This list-decoding algorithm is algebraic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Network conditions generally cause errors on network packets. Correction of these errors is in the subject of "forward error… (More)
  • figure 3
  • figure 4
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
1999
Highly Cited
1999
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
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)
Is this relevant?
1997
1997
We describe a new algorithm for the decoding of Reed Solomon codes. This algorithm was originally described in [12]. While the… (More)
  • figure 1
  • figure 2
Is this relevant?