A locally encodable and decodable compressed data structure
In a variety of applications, ranging from highspeed networks to massive databases, there is a need to maintain histograms and other statistics in a streaming manner. Motivated by such applications, we establish the existence of efficient source codes that are both locally encodable and locally deco...
Main Authors: | Chandar, Venkat B., Shah, Devavrat, Wornell, Gregory W. |
---|---|
Other Authors: | Lincoln Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2010
|
Online Access: | http://hdl.handle.net/1721.1/58949 https://orcid.org/0000-0003-0737-3259 https://orcid.org/0000-0001-9166-4758 |
Similar Items
-
Local recovery in data compression for general sources
by: Wornell, Gregory W, et al.
Published: (2018) -
A simple message-passing algorithm for compressed sensing
by: Chandar, Venkat B., et al.
Published: (2012) -
Update-Efficiency and Local Repairability Limits for Capacity Approaching Codes
by: Mazumdar, Arya, et al.
Published: (2014) -
Sparse graph codes for compression, sensing, and secrecy
by: Chandar, Venkat (Venkat Bala)
Published: (2010) -
A Novel Asynchronous Communication Paradigm: Detection, Isolation, and Coding
by: Wornell, Gregory W., et al.
Published: (2011)