Two algorithms for constructing efficient huffman-code based reversible variable length codes
Chia-Wei Lin, Ja‐Ling Wu, Yuh-Jue Chuang · IEEE Transactions on Communications · 2008
In this paper, Huffman-code based reversible variable length code (RVLC) construction algorithms are studied. We use graph models to represent the prefix, suffix and Hamming distance relationships among RVLC candidate codewords. The properties of the so-obtained graphs are investigated in detail, based on which we present two efficient RVLC construction algorithms: algorithm 1 aims at minimizing the average codeword length while algorithm 2 jointly minimizes the average codeword length and maximizes the error detection probability at the same time.