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
012319752014

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
  • 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
A construction of expander codes is presented with the following three properties: i) the codes lie close to the Singleton bound… (More)
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
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)
  • figure 1
Is this relevant?
2005
2005
For every 0 < R < 1 and ε > 0, we present an explicit construction of error-correcting codes of rate R that can be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2005
2005
An analogy is examined between serially concatenated codes and parallel concatenations whose interleavers are described by… (More)
  • figure 1
  • figure 2
Is this relevant?
2004
2004
The minimum distance of some families of expander codes is studied, as well as some related families of codes defined on… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
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?
Highly Cited
1992
Highly Cited
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
Justesen has shown that concatenating a class of binary codes with a Reed-Solomon (RS) code produces asymptotically good codes… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?