Dynamic Shannon Coding
Travis Gagie
Abstract
We present a new algorithm for dynamic prefix-free coding, based on Shannon coding. We give a simple analysis and prove a better upper bound on the length of the encoding produced than the corresponding bound for dynamic Huffman coding. We show how our algorithm can be modified for efficient length-restricted coding, alphabetic coding and coding with unequal letter costs.
Create a lesson
Related papers
Embedding Information in Policy Randomness: Distribution-Preserving Implicit Communication in MDPs
Gongpu Chen, Deniz Gündüz
Exact Privacy--Distortion Design of Support-Constrained Randomized Response
Amirreza Zamani, Parastoo Sadeghi, Mikael Skoglund
Fine asymptotics for approximate simulation of symmetric channels
Valentinian Lungu, Aaron B. Wagner, Ioannis Kontoyiannis
Higher-order nonhomomorphicity under affine restrictions
Serge Feukoua, Ana Sălăgean, Pantelimon Stănică
Low-Latency Belief-Propagation Decoding of Quantum LDPC Codes with Reinforcement-Learned Scheduling
Mohsen Moradi, Ghilas Aissou, Taejoon Kim et al.
Residual-Information Generalization Bounds Under Selective Privacy: Extended Version
Amirreza Zamani, Parastoo Sadeghi, Mikael Skoglund