All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
Zyablov bound
In coding theory, the Zyablov bound is a lower bound on the rate and relative distance of concatenated codes.
Wikipedia
Topic mentions per year
Topic mentions per year
1975-2014
0
1
2
3
1975
2014
Related topics
Related topics
5 relations
Broader (3)
Coding theory
Error detection and correction
Information theory
Concatenated error correction code
Singleton bound
Related mentions per year
Related mentions per year
1952-2018
1960
1980
2000
2020
Zyablov bound
Error detection and correction
Information theory
Coding theory
Concatenated error correction code
Singleton bound
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Locally Correctable and Testable Codes Approaching the Singleton Bound
Or Meir
Electronic Colloquium on Computational Complexity
2014
Locally-correctable codes (LCCs) and locally-testable codes (LTCs) are codes that admit local algorithms for decoding and testing…Â
(More)
Is this relevant?
2006
2006
Improved Nearly-MDS Expander Codes
Ron M. Roth
,
Vitaly Skachek
IEEE Transactions on Information Theory
2006
A construction of expander codes is presented with the following three properties: i) the codes lie close to the Singleton bound…Â
(More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Linear-time encodable/decodable codes with near-optimal rate
Venkatesan Guruswami
,
Piotr Indyk
IEEE Transactions on Information Theory
2005
We present an explicit construction of linear-time encodable and decodable codes of rate r which can correct a fraction (1-r-/spl…Â
(More)
Is this relevant?
2005
2005
Explicit capacity-achieving list-decodable codes
Venkatesan Guruswami
,
Atri Rudra
STOC
2005
For every 0 < R < 1 and ε > 0, we present an explicit construction of error-correcting codes of rate R that can be…Â
(More)
Is this relevant?
2005
2005
Concatenated codes: serial and parallel
Alexander Barg
,
Gilles Zémor
IEEE Transactions on Information Theory
2005
An analogy is examined between serially concatenated codes and parallel concatenations whose interleavers are described by…Â
(More)
Is this relevant?
2004
2004
Distance properties of expander codes
Alexander Barg
,
Gilles Zémor
IEEE Transactions on Information Theory
2004
The minimum distance of some families of expander codes is studied, as well as some related families of codes defined on…Â
(More)
Is this relevant?
2002
2002
Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
Venkatesan Guruswami
,
Piotr Indyk
STOC
2002
We present an <i>explicit</i> construction of <i>linear-time encodable and decodable</i> codes of rate <i>r</i> which can correct…Â
(More)
Is this relevant?
1993
1993
A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
Ba-Zhong Shen
IEEE Trans. Information Theory
1993
Â
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
Noga Alon
,
Jehoshua Bruck
,
Joseph Naor
,
Moni Naor
,
Ron M. Roth
IEEE Trans. Information Theory
1992
A new technique, based on the pseudo-random properties of certain graphs, known as expanders, is used to obtain new simple…Â
(More)
Is this relevant?
1975
1975
Some results on the problem of constructing asymptotically good error-correcting codes
E. J. Weldon
IEEE Trans. Information Theory
1975
Justesen has shown that concatenating a class of binary codes with a Reed-Solomon (RS) code produces asymptotically good codes…Â
(More)
Is this relevant?