scientific article; zbMATH DE number 4210044

MaRDI QIDQ3358643zbMATH OpenFDO

Authors Raymond W. Yeung

Publication date 1991

zbMATH Keywords

alphabetic codebinary test problemscharacteristic inequalityHuffman codeKraft inequalitylower boundsoptimal alphabetic codeordered probability distributionprefix codeupper bound

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

(19)

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

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)