TL;DR
This paper investigates the concept of stability in lossless source coding, analyzing how small changes in source sequences affect codewords, and establishes theoretical limits on compression rates for stable codes using combinatorial methods.
Contribution
It introduces a formal definition of stability in source coding and derives information-theoretic limits on achievable rates for stable codes using combinatorial analysis.
Findings
Random binning is inherently unstable.
Derived bounds on compression rates for stable codes.
Established a theoretical framework linking stability parameters to coding limits.
Abstract
A source encoder is stable if a small change in the source sequence (e.g., changing a few symbols) results in a small (or bounded) change in the output codeword. By this definition, the common technique of random binning is unstable; because the mapping is random, two nearly identical source sequences can be assigned to completely unrelated bin indices. We study compression rates of stable lossless source codes. Using combinatorial arguments, we derive information-theoretic limits on the achievable rate as a function of the stability parameters.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Algorithms and Data Compression · Cellular Automata and Applications