Dynamic Shannon Coding
Information Theory
2007-07-16 v1 math.IT
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.
Keywords
Cite
@article{arxiv.cs/0503085,
title = {Dynamic Shannon Coding},
author = {Travis Gagie},
journal= {arXiv preprint arXiv:cs/0503085},
year = {2007}
}
Comments
6 pages; conference version presented at ESA 2004; journal version submitted to IEEE Transactions on Information Theory