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
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > High-rate codes with sublinear-time decoding