High-rate codes with sublinear-time decoding

In this paper we construct a new family of locally decodable codes that have very effcient local decoding algorithms, and at the same time have rate approaching one.

In  Electronic Colloquium on Computational Complexity (ECCC)

Details

TypeArticle
> Publications > High-rate codes with sublinear-time decoding