Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,733,651 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.
2007
2007
A New MDS Erasure Code for RAID-6
J. Plank
2007
Corpus ID: 15157621
The RAID-6 specification calls for a storage system with multiple storage devices to tolerate the failure of any two devices…
Expand
2007
2007
The Performance Analysis of MPE-FEC Decoding Methods at the DVB-H Link Layer for Efficient IP Packet Retrieval
J. Paavola
,
H. Himmanen
,
T. Jokela
,
J. Poikonen
,
V. Ipatov
IEEE transactions on broadcasting
2007
Corpus ID: 32683779
DVB-H is a new broadcasting standard, which offers reliable high data rate reception of IP packets for mobile handheld battery…
Expand
2004
2004
A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance
S. Egorov
,
G. Markarian
,
K. Pickavance
IEEE Transactions on Communications
2004
Corpus ID: 21304292
A modification of the Blahut algorithm is proposed for decoding of Reed-Solomon codes beyond half the minimum distance. An…
Expand
2003
2003
Interpolation multiplicity assignment algorithms for algebraic soft-decision decoding of Reed-Solomon codes
Mostafa El-Khamy
,
R. McEliece
Algebraic Coding Theory and Information Theory
2003
Corpus ID: 46415187
Review
2002
Review
2002
Reections on \Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes"
V. Guruswami
,
M. Sudan
2002
Corpus ID: 197443428
A t-error-correcting code over a q-ary alphabet Fq is a set C ⊆ Fq such that for any received vector r ∈ Fq there is at most one…
Expand
1999
1999
Analog Codes for Peak-to-Average Ratio Reduction
W. Henkel
1999
Corpus ID: 15751394
| Multi-tone modulation (DMT, Discrete Multitone, OFDM, Orthogonal Frequency Division Multiplex) has the disadvantage of a quite…
Expand
1998
1998
Potential and modeling of 1-μm SOI CMOS operational transconductance amplifiers for applications up to 1 GHz
J. Eggermont
,
D. Flandre
,
J. Raskin
,
J. Colinge
IEEE J. Solid State Circuits
1998
Corpus ID: 61286796
The potential of 1-/spl mu/m SOI complementary metal-oxide-semiconductor (CMOS) technology for the realization of operational…
Expand
1994
1994
An efficient soft-decision Reed-Solomon decoding algorithm
D. Taipale
,
M. Seo
IEEE Transactions on Information Theory
1994
Corpus ID: 31920996
We develop a computationally efficient soft-decision Reed-Solomon (RS) decoding algorithm. Our new algorithm has direct…
Expand
1984
1984
Coding for a Multiple-Access Frequency-Hopping System
G. Einarsson
IEEE Transactions on Communications
1984
Corpus ID: 44929483
A multiuser system employing on-off FSK modulation in conjunction with frequency hopping is examined for digital transmission…
Expand
1971
1971
kth order near-orthogonal codes
I. Reed
1971
Corpus ID: 117723508
Abstract : Certain near-orthogonal codes have recently been used in multiple- short keying communication systems. The codes…
Expand