Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,164,908 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
(opens in a new tab)
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.
2005
2005
Justesen-Type Modified Expander Codes and Their Decoding Algorithm
Hachiro Fujita
,
K. Sakaniwa
IEICE Transactions on Fundamentals of Electronics…
2005
Corpus ID: 26531484
In 1996, Sipser and Spielman [12] constructed a family of linear-time decodable asymptotically good codes called expander codes…
Expand
1997
1997
Iterative decoding of generalized concatenated convolutional codes
K. Fazel
International Conference on Communications
1997
Corpus ID: 12115993
The aim of this article is first to generalize the principle of iterative decoding algorithm for the generalized concatenated…
Expand
1978
1978
New Codes Beyond the Zyablov Bound and the Goppa-Based Justesen Codes.
R. Kleinhenz
1978
Corpus ID: 115376496
Abstract : In this report, constructions are given for two new block codes. The first construction produces a class of…
Expand
1975
1975
Some results on the problem of constructing asymptotically good error-correcting codes
E. Weldon
IEEE Transactions on Information Theory
1975
Corpus ID: 2474564
Justesen has shown that concatenating a class of binary codes with a Reed-Solomon (RS) code produces asymptotically good codes…
Expand