scientific article

zbMath0731.94008MaRDI QIDQ3358643

Raymond W. Yeung

Publication date: 1991

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

upper boundlower boundsprefix codeHuffman codeKraft inequalityalphabetic codebinary test problemscharacteristic inequalityoptimal alphabetic codeordered probability distribution

Mathematics Subject Classification ID

Bounds on codes (94B65) Prefix, length-variable, comma-free codes (94A45)

Related Items (11)

On binary search trees ⋮ Efficient Construction of Near-Optimal Binary and Multiway Search Trees ⋮ Operations research applications of dichotomous search ⋮ Characteristic inequalities for binary trees ⋮ Dynamic Trees with Almost-Optimal Access Cost ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ Minimax trees in linear time with applications ⋮ Optimal binary search trees ⋮ Assembling approximately optimal binary search trees efficiently using arithmetics ⋮ Alphabetic coding with exponential costs ⋮ On the cost of unsuccessful searches in search trees with two-way comparisons

This page was built for publication: