Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,217,198 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Berlekamp–Welch algorithm
Block code
Code rate
Coding theory
Expand
Broader (2)
Computational complexity theory
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
V. Guruswami
,
Carol Wang
IEEE Transactions on Information Theory
2013
Corpus ID: 9656968
Folded Reed-Solomon (RS) codes are an explicit family of codes that achieve the optimal tradeoff between rate and list error…
Expand
Highly Cited
2013
Highly Cited
2013
List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
V. Guruswami
,
C. Xing
Symposium on the Theory of Computing
2013
Corpus ID: 3333249
We consider Reed-Solomon (RS) codes whose evaluation points belong to a subfield, and give a linear-algebraic list decoding…
Expand
Highly Cited
2011
Highly Cited
2011
Linear-Algebraic List Decoding of Folded Reed-Solomon Codes
V. Guruswami
IEEE 26th Annual Conference on Computational…
2011
Corpus ID: 12067714
Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction…
Expand
2009
2009
Decoding Folded Reed-Solomon Codes Using Hensel-Lifting
Peter Beelen
,
K. Brander
Gröbner Bases, Coding, and Cryptography
2009
Corpus ID: 60983700
A standard problem in coding theory is to construct good codes together with an efficient decoder. This paper addresses the…
Expand
Highly Cited
2009
Highly Cited
2009
The Recycling Folded Cascode: A General Enhancement of the Folded Cascode Amplifier
R. Assaad
,
J. Silva-Martínez
IEEE Journal of Solid-State Circuits
2009
Corpus ID: 43995423
A recycling amplifier architecture based on the folded cascode transconductance amplifier is described. The proposed amplifier…
Expand
Highly Cited
2003
Highly Cited
2003
A New Algorithm for Decoding Reed-Solomon Codes
Shuhong Gao
2003
Corpus ID: 16399122
A new algorithm is developed for decoding Reed-Solomon codes. It uses fast Fourier transforms and computes the message symbols…
Expand
Highly Cited
2001
Highly Cited
2001
High-speed architectures for Reed-Solomon decoders
D. Sarwate
,
Naresh R Shanbhag
IEEE Transactions on Very Large Scale Integration…
2001
Corpus ID: 7145528
New high-speed VLSI architectures for decoding Reed-Solomon codes with the Berlekamp-Massey algorithm are presented in this paper…
Expand
Highly Cited
1995
Highly Cited
1995
Master “blind” thrust faults hidden under the Zagros folds: active basement tectonics and surface morphotectonics
M. Berberian
1995
Corpus ID: 54834015
Highly Cited
1982
Highly Cited
1982
Bit-serial Reed - Solomon encoders
E. Berlekamp
IEEE Transactions on Information Theory
1982
Corpus ID: 11461442
This paper presents new concepts and techniques for implementing encoders for Reed-Solomon codes, with or without interleaving…
Expand
Highly Cited
1949
Highly Cited
1949
King Solomon's Ring
K. Lorenz
1949
Corpus ID: 150121941
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE