scientific article; zbMATH DE number 4210044

MaRDI QIDQ3358643zbMATH OpenFDO

Authors Raymond W. Yeung

Publication date 1991

zbMATH Keywords

lower boundsupper boundHuffman codeprefix codeKraft inequalityalphabetic codebinary test problemscharacteristic inequalityoptimal alphabetic codeordered probability distribution

Mathematics Subject Classification ID

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

Recommendations

• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Bounds on the redundancy of binary alphabetical codes
• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• Optimum extensions of prefix codes.
• Efficient construction of minimum-redundancy codes for large alphabets

Cited in

(17)

• Alpha-conversion and typability
• On binary search trees
• Near-Optimal Depth-Constrained Codes
• On the Huffman and alphabetic tree problem with general cost functions
• Dynamic Trees with Almost-Optimal Access Cost
• Assembling approximately optimal binary search trees efficiently using arithmetics
• Alphabetic coding with exponential costs
• scientific article; zbMATH DE number 3889419 (Why is no real title available?)
• scientific article; zbMATH DE number 1353836 (Why is no real title available?)
• An optimum encoding with minimum longest code and total number of digits
• Optimal binary search trees
• Minimax trees in linear time with applications
• On the cost of unsuccessful searches in search trees with two-way comparisons
• Operations research applications of dichotomous search
• Codes with monotonic codeword lengths
• Efficient Construction of Near-Optimal Binary and Multiway Search Trees
• Characteristic inequalities for binary trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358643)