| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10332598 | Journal of Algorithms | 2005 | 7 Pages |
Abstract
An easy algorithm is described a special case of which will generate a list of all n-ary Huffman sequences of length m, for any given integers m⩾1, n⩾2.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Dean Hoffman, Peter Johnson, Nadine Wilson,