Computing and estimating the number of \(n\)-ary Huffman sequences of a specified length (Q616352)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing and estimating the number of n-ary Huffman sequences of a specified length |
scientific article; zbMATH DE number 5833935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing and estimating the number of \(n\)-ary Huffman sequences of a specified length |
scientific article; zbMATH DE number 5833935 |
Statements
Computing and estimating the number of \(n\)-ary Huffman sequences of a specified length (English)
0 references
7 January 2011
0 references
The paper deals with the number \(h(q,n)\) of different \(n\)-ary Huffman sequences of length \(q\). For \(n=2\) the number \(h(q,2)\) has been established in [\textit{E. Norwood}, IEEE Trans. Inf. Theory 13, 613--616 (1967; Zbl 0183.22005)]. This paper presents the recursive formula for computation of \(h(n,q)\), for each \(n \geq 2\). Moreover, it permits an estimation of \(h(q,n)\) which, for \(n=2\), upscales the result of \textit{J. Burkert} [Bull. Inst. Comb. Appl. 58, 79--82 (2010; Zbl 1222.11020)].
0 references
full \(n\)-ary tree
0 references
Huffman's algorithm
0 references
linear difference equations
0 references
0.8158678412437439
0 references
0.7892104983329773
0 references
0.7436057329177856
0 references
0.7177438735961914
0 references
