scientific article; zbMATH DE number 4210044

zbMATH Open0731.94008MaRDI QIDQ3358643FDOQ3358643

Authors: Raymond W. Yeung 

Publication date: 1991

Title of this publication is not available (Why is that?)

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

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)

Cited In (17)

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Alpha-conversion and typability

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)