Short Huffman Codes Producing 1s Half of the Time

Details Short Huffman Codes Producing 1s Half of the Time Short Huffman Codes Producing 1s Half of the Time

2011-07-22

arxiv.org/abs/1107.4500v1

Computer Science

Information Theory

submitted to ICSPCS 2011, Honolulu

Scientific paper

The design of the channel part of a digital communication system (e.g., error correction, modulation) is heavily based on the assumption that the data to be transmitted forms a fair bit stream. However, simple source encoders such as short Huffman codes generate bit streams that poorly match this assumption. As a result, the channel input distribution does not match the original design criteria. In this work, a simple method called half Huffman coding (halfHc) is developed. halfHc transforms a Huffman code into a source code whose output is more similar to a fair bit stream. This is achieved by permuting the codewords such that the frequency of 1s at the output is close to 0.5. The permutations are such that the optimality in terms of achieved compression ratio is preserved. halfHc is applied in a practical example, and the resulting overall system performs better than when conventional Huffman coding is used.

Affiliated with

Also associated with

No associations

Rating

Short Huffman Codes Producing 1s Half of the Time 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 Short Huffman Codes Producing 1s Half of the Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Short Huffman Codes Producing 1s Half of the Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-676471