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.
2014
2014
  • Or Meir
  • Electronic Colloquium on Computational Complexity
  • 2014
  • Corpus ID: 1174078
Locally-correctable codes (LCCs) and locally-testable codes (LTCs) are codes that admit local algorithms for decoding and testing… Expand
Is this relevant?
2005
2005
An analogy is examined between serially concatenated codes and parallel concatenations whose interleavers are described by… Expand
  • figure 1
  • figure 2
Is this relevant?
1997
1997
  • Khaled 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
Is this relevant?
1996
1996
  • Khaled 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
Is this relevant?
1993
1993
An explicit construction of a sequence of binary codes that asymptotically meet the Zyablov bound for rates lower than 0.30 is… Expand
Is this relevant?
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
Is this relevant?
1990
1990
A combined source-channel encoding of images with a small amount of redundancy is investigated. The source encoder under study is… Expand
Is this relevant?
1988
1988
The authors investigate and compare two different soft decoding schemes. The first approach considered is the algorithm devised… Expand
Is this relevant?
1986
1986
Blokh-Zyablov [1] devised a decoding algorithm for concatenated codes, which is capable of maximum random error correction. The… Expand
Is this relevant?
1978
1978
A new class of asymptotically good codes is constructed by iteratively superimposing Justesen codes on a Justesen code. The lower… Expand
Is this relevant?