arXiv · 2611.11501
Compression of Sources with Memory and Private Random Access
Abstract
Private local decoding imposes a stringent constraint on compression: the codeword bits used to recover a source symbol must reveal nothing about the remaining symbols beyond what the recovered symbol itself reveals. For memoryless sources, this constraint is known to be compatible with entropy-rate compression. We show that the same holds for any stationary ergodic source over a finite alphabet. Specifically, every rate above the entropy rate is achievable with exact privacy and error-free local decoding on a set of source sequences whose probability tends to one. In contrast, we exhibit non-ergodic sources for which private local decoding incurs a strictly positive rate penalty.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka. 2026-11-08. Compression of Sources with Memory and Private Random Access. https://searcharxiv.com/abs/2611.11501
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.