In coding theory, the Zyablov bound is a lower bound on the rate and relative distance of concatenated codes.

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

- 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

- 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

- 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

- 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

- 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

- 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

Highly Cited

1992

Highly Cited

1992

- 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

- 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?