Reserved-Length Prefix Coding

Details Reserved-Length Prefix Coding Reserved-Length Prefix Coding

2007-12-30

arxiv.org/abs/0801.0102v1

Computer Science

Information Theory

5 pages, submitted to ISIT 2008

Scientific paper

Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all codewords have lengths that lie in a user-specified set of lengths (or, equivalently, no codewords have lengths that lie in a complementary set). This paper introduces a polynomial-time dynamic programming algorithm that finds optimal codes for this reserved-length prefix coding problem. This has applications to quickly encoding and decoding lossless codes. In addition, one modification of the approach solves any quasiarithmetic prefix coding problem, while another finds optimal codes restricted to the set of codes with g codeword lengths for user-specified g (e.g., g=2).

Affiliated with

Also associated with

No associations

Rating

Reserved-Length Prefix 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 Reserved-Length Prefix Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reserved-Length Prefix Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-713875