Home → Magazine Archive → May 1972 (Vol. 15, No. 5) → Algorithm 428: Hu-Tucker minimum redundancy alphabetic... → Abstract

Algorithm 428: Hu-Tucker minimum redundancy alphabetic coding method [Z]

By J. M. Yohe

Communications of the ACM, Vol. 15 No. 5, Pages 360-362

This algorithm implements the Hu-Tucker method of variable length, minimum redundancy alphabetic binary encoding [1]. The symbols of the alphabet are considered to be an ordered forest of n terminal nodes. Two nodes in an ordered forest are said to be tentative-connecting if the sequence of nodes between the two given nodes is either empty or consists entirely of nonterminal nodes.

The full text of this article is premium content


No entries found