Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
High-rate codes with sublinear-time decoding

Swastik Kopparty, Shubhangi Saraf, and Sergey Yekhanin

Abstract

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.

Details

Publication typeArticle
Published inElectronic Colloquium on Computational Complexity (ECCC)
> Publications > High-rate codes with sublinear-time decoding