TL;DR
This paper introduces a new dynamic prefix-free coding algorithm based on Shannon coding, offering improved bounds over dynamic Huffman coding and adaptable for various coding constraints.
Contribution
The paper presents a novel dynamic Shannon coding algorithm with better theoretical bounds and versatile modifications for different coding requirements.
Findings
Improved upper bounds on encoding length compared to dynamic Huffman coding
Algorithm can be adapted for length-restricted, alphabetic, and unequal letter cost coding
Simple analysis demonstrating the efficiency of the proposed method
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.
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
TopicsNeural Networks and Applications · Computability, Logic, AI Algorithms