Zyablov bound

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

A construction of expander codes is presented with the following three properties: i) the codes lie close to the Singleton bound… (More)

We present an explicit construction of linear-time encodable and decodable codes of rate r which can correct a fraction (1-r-/spl… (More)

For every 0 < R < 1 and ε > 0, we present an explicit construction of error-correcting codes of rate R that can be… (More)

An analogy is examined between serially concatenated codes and parallel concatenations whose interleavers are described by… (More)

The minimum distance of some families of expander codes is studied, as well as some related families of codes defined on… (More)

We present an <i>explicit</i> construction of <i>linear-time encodable and decodable</i> codes of rate <i>r</i> which can correct… (More)

 

A new technique, based on the pseudo-random properties of certain graphs, known as expanders, is used to obtain new simple… (More)

Justesen has shown that concatenating a class of binary codes with a Reed-Solomon (RS) code produces asymptotically good codes… (More)