The Effect of Local Decodability Constraints on Variable-Length Compression

• Published in: IEEE transactions on information theory Vol. 64; no. 4; pp. 2593 - 2608
• Main Authors: Pananjady, Ashwin, Courtade, Thomas A.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.04.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: bit-probe; Codes; Complexity; Complexity theory; Data structures; Decoding; local decoding; Lower bounds; Probes; Source coding; static membership; Symbols; Upper bound; Variable-length compression
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2018.2804441

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 <inline-formula> <tex-math notation="LaTeX">r </tex-math></inline-formula>-sparse binary sequences, under the constraint that any source bit can be correctly decoded upon probing at most <inline-formula> <tex-math notation="LaTeX">d </tex-math></inline-formula> codeword bits. We consider both adaptive and non-adaptive access models, and derive upper and lower bounds that often coincide up to constant factors. Such a characterization for the fixed-blocklength analog of our problem, known as the bit probe complexity of static membership, remains unknown despite considerable attention from researchers over the last few decades. We also show that locally decodable schemes for sparse sequences are able to decode 0s (frequent source symbols) of the source with far fewer probes on average than they can decode 1s (infrequent source symbols), thus rigorizing the notion that infrequent symbols require high probe complexity, even on average. Connections to the fixed-blocklength model and to communication complexity are also briefly discussed.