Balance of 0, 1 Bits for Huffman and Reversible Variable-Length Coding

Abstract

This letter proposes a novel algorithm to obtain a suboptimal solution for the balance of bit distribution after Huffman coding. The algorithm is simple, and can be embedded in the conventional Huffman coding process. In addition, the letter also discusses the bit-balance problem for reversible variable-length codes (RVLCs) based on Huffman coding. Analytical and experimental results suggest that the new algorithm is very useful in improving the 0/1 balance property for Huffman codes and RVLCs.