Name
Abstract | ||
|---|---|---|
Locally decodable codes are error correcting codes that simultaneously provide efficient random-access to encoded data and high noise resilience by allowing reliable reconstruction of an arbitrary data bit from looking at only a small number of randomly chosen codeword bits. Local decodability comes at the price of certain loss in terms of code efficiency. Specifically, locally decodable codes require longer codeword lengths than their classical counterparts. In this work we briefly survey the recent progress in constructions of locally decodable codes. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-20901-7_18 | IWCC |
Keywords | Field | DocType |
local decodability,brief survey,decodable code,high noise resilience,arbitrary data bit,code efficiency,codeword length,classical counterpart,encoded data,codeword bit,certain loss | Small number,Locally decodable code,Error floor,Block code,Locally testable code,Theoretical computer science,Reed–Muller code,Code word,Message length,Mathematics | Conference |
Citations | PageRank | References |
4 | 0.41 | 21 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergey Yekhanin | 1 | 983 | 52.33 |