Name
Abstract | ||
|---|---|---|
We consider a variable-length source coding problem subject to local decodability constraints. In particular, we investigate the blocklength scaling behavior attainable by encodings of r-sparse binary sequences, under the constraint that any source bit can be correctly decoded upon probing at most d codeword bits. We consider both adaptive and nonadaptive access models, and derive upper and lower ... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TIT.2018.2804441 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Probes,Complexity theory,Decoding,Source coding,Data structures,Upper bound | Data structure,Discrete mathematics,Upper and lower bounds,Computer science,Source code,Algorithm,Communication complexity,Code word,Decoding methods,Scaling,Binary number | Journal |
Volume | Issue | ISSN |
64 | 4 | 0018-9448 |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ashwin Pananjady | 1 | 40 | 9.69 |
| Thomas A. Courtade | 2 | 3 | 1.16 |