Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Zyablov bound

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
This paper presents an efficient algorithm for finding the dominant trapping sets of a low-density parity-check (LDPC) code. This… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Review
2008
Review
2008
  • V. Skachek
  • Information Theory and Applications Workshop
  • 2008
  • Corpus ID: 17331002
Several expander code constructions and their parameters are surveyed. New generalized expander codes are introduced and their… Expand
  • figure 1
2005
2005
For every 0 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
1997
1997
  • K. Fazel
  • Proceedings of ICC'97 - International Conference…
  • 1997
  • Corpus ID: 12115993
The aim of this article is first to generalize the principle of iterative decoding algorithm for the generalized concatenated… Expand
1996
1996
  • K. Fazel
  • Proceedings of ICC/SUPERCOMM '96 - International…
  • 1996
  • Corpus ID: 60502314
The aim of this study is to look at the performance of an iterative decoding algorithm applied to the decoding of Blokh-Zyablov… Expand
  • figure 3
  • figure 1
  • figure 2
  • table 1
  • figure 4
1993
1993
  • B. Shen
  • IEEE Trans. Inf. Theory
  • 1993
  • Corpus ID: 38531770
An explicit construction of a sequence of binary codes that asymptotically meet the Zyablov bound for rates lower than 0.30 is… Expand
Highly Cited
1992
Highly Cited
1992
A novel technique, based on the pseudo-random properties of certain graphs known as expanders, is used to obtain novel simple… Expand
1990
1990
A combined source-channel encoding of images with a small amount of redundancy is investigated. The source encoder under study is… Expand
1986
1986
Blokh-Zyablov [1] devised a decoding algorithm for concatenated codes, which is capable of maximum random error correction. The… Expand
1978
1978
A new class of asymptotically good codes is constructed by iteratively superimposing Justesen codes on a Justesen code. The lower… Expand