Compressing sparse sequences under local decodability constraints

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...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings / IEEE International Symposium on Information Theory pp. 2979 - 2983
Main Authors: Pananjady, Ashwin, Courtade, Thomas A.
Format: Conference Proceeding Journal Article
Language:English
Published: IEEE 01.06.2015
Subjects:
Bioinformatics
Blocking
Coding
Complexity theory
Compressing
Constants
Data structures
Decoding
Information theory
Joints
Lower bounds
Mathematical models
Probes
Source coding
ISSN:2157-8095, 2157-8117
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 non-adaptive access models, and derive upper and lower bounds that often coincide up to constant factors. Notably, such a characterization for the fixed-blocklength analog of our problem remains unknown, despite considerable research efforts. Connections to communication complexity are also briefly discussed.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2015.7283003