Dynamic Shannon Coding

Details Dynamic Shannon Coding Dynamic Shannon Coding

2005-03-30

arxiv.org/abs/cs/0503085v1

Computer Science

Information Theory

6 pages; conference version presented at ESA 2004; journal version submitted to IEEE Transactions on Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Dynamic Shannon Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamic Shannon Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Shannon Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-439197