Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,471,942 papers from all fields of science
Search
Sign In
Create Free Account
Zyablov bound
In coding theory, the Zyablov bound is a lower bound on the rate and relative distance of concatenated codes.
Wikipedia
Create Alert
Alert
Related topics
Related topics
5 relations
Broader (3)
Coding theory
Error detection and correction
Information theory
Concatenated error correction code
Singleton bound
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
An efficient algorithm for finding dominant trapping sets of LDPC codes
M. Karimi
,
A. Banihashemi
6th International Symposium on Turbo Codes…
2010
Corpus ID: 855692
This paper presents an efficient algorithm for finding the dominant trapping sets of a low-density parity-check (LDPC) code. This…
Expand
Review
2008
Review
2008
Minimum distance bounds for expander codes
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
2005
2005
Explicit Capacity-Achieving List-Decodable Codes or Decoding Folded Reed-Solomon Codes up to their Distance
V. Guruswami
,
A. Rudra
2005
Corpus ID: 14673287
For every 0 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial…
Expand
1997
1997
Iterative decoding of generalized concatenated convolutional codes
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
Iterative decoding of generalized concatenated Blokh-Zyablov-codes
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
1993
1993
A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate
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
1990
1990
Application of unequal error protection codes on combined source-channel coding of images
K. Fazel
,
J. Lhuillier
IEEE International Conference on Communications…
1990
Corpus ID: 116906640
A combined source-channel encoding of images with a small amount of redundancy is investigated. The source encoder under study is…
Expand
1988
1988
Cyclic unequal error protection codes constructed from cyclic codes of composite length
M. Lin
,
Shu Lin
IEEE Trans. Inf. Theory
1988
Corpus ID: 4001266
The unequal error correction capabilities of binary cyclic codes of composite length are investigated. Under certain conditions…
Expand
1986
1986
A Simple Analysis of the Blokh-Zyablov Decoding Algorithm
T. Ericson
AAECC
1986
Corpus ID: 45245264
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 beyond the Zyablov bound
Y. Sugiyama
,
M. Kasahara
,
S. Hirasawa
,
T. Namekawa
IEEE Trans. Inf. Theory
1978
Corpus ID: 39652148
A new class of asymptotically good codes is constructed by iteratively superimposing Justesen codes on a Justesen code. The lower…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE