A heuristic algorithm for the construction of a code with limited word length (Corresp.)
Jan De Lameillieure · IEEE Transactions on Information Theory · 1987
A depth-first algorithm is presented for the construction of a binary minimum-redundancy variable length code with limited word length. In this algorithm, heuristic information on the mean word length is used for efficient searching. The extension toQ-ary codes is also discussed.