Varn Codes and Generalized Fibonacci Trees
Julia Abrahams · The Fibonacci Quarterly · 1995
Yarn's [6] algorithm solves the problem of finding an optimal code tree, optimal in the sense of minimum average cost, when the code symbols are of unequal cost and the source symbols are equiprobable. He addresses both exhaustive codes, for which the code tree is a full tree, as well as nonexhaustive codes, but only the exhaustive case will be of concern here. In particular, for