Zyablov bound

Locally-correctable codes (LCCs) and locally-testable codes (LTCs) are codes that admit local algorithms for decoding and testing… Expand

An analogy is examined between serially concatenated codes and parallel concatenations whose interleavers are described by… 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

The authors investigate and compare two different soft decoding schemes. The first approach considered is the algorithm devised… 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