Huffman codes are most prevalent in practical operation.Other than compressing efficiency

there are other criteria

such as codewords' MSE

channel bit-error resilience

etc.This paper discusses the problem of the probabilities of 0

1 bits in codeword stream after Huffman coding.Mathematical modeling and analysis is given

which shows that accustomed Huffman codes are the worst according to this criterion.The optimal case is derived

and a sub-optimal algorithm is constructed to make the probabilities of 0

1 bits equal.The algorithm can be included in the original Huffman coding

and the complexity added is small.Experiments are given in the end

which attest our ideas.