Zyablov bound

This paper presents an efficient algorithm for finding the dominant trapping sets of a low-density parity-check (LDPC) code. This… Expand

Several expander code constructions and their parameters are surveyed. New generalized expander codes are introduced and their… Expand

For every 0 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial… Expand

The aim of this article is first to generalize the principle of iterative decoding algorithm for the generalized concatenated… Expand

The aim of this study is to look at the performance of an iterative decoding algorithm applied to the decoding of Blokh-Zyablov… Expand

An explicit construction of a sequence of binary codes that asymptotically meet the Zyablov bound for rates lower than 0.30 is… Expand

A novel technique, based on the pseudo-random properties of certain graphs known as expanders, is used to obtain novel simple… Expand

A combined source-channel encoding of images with a small amount of redundancy is investigated. The source encoder under study is… Expand

Blokh-Zyablov [1] devised a decoding algorithm for concatenated codes, which is capable of maximum random error correction. The… Expand

A new class of asymptotically good codes is constructed by iteratively superimposing Justesen codes on a Justesen code. The lower… Expand