Huffman algebras for independent random variables

DOI10.1007/BF01516009zbMath0786.60003MaRDI QIDQ1314848

Cheng-Shang Chang, Joy A. Thomas

Publication date: 21 April 1994

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

zbMATH Keywords

entropy; stochastic ordering; Huffman algorithm; Huffman algebras

Mathematics Subject Classification ID

60A99: Foundations of probability theory

94A29: Source coding

Related Items

Huffman algebras for independent random variables, An asymptotic theory for recurrence relations based on minimization and maximization.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Huffman's algorithm via algebra
• Huffman algebras for independent random variables
• Rearrangement, Majorization and Stochastic Scheduling
• Uniform stochastic ordering and related inequalities
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• Conditions for Optimality of the Huffman Algorithm
• Bivariate characterization of some stochastic order relations
• A new ordering for stochastic majorization: theory and applications
• Optimal Alphabetic Trees
• On the Optimality of Huffman Trees
• Combinatorial Merging
• Combinatorial Merging and Huffman's Algorithm
• Generalized Huffman Trees
• Binary Trees Optimum Under Various Criteria
• Optimal issuing policies under stochastic field lives
• A Method for the Construction of Minimum-Redundancy Codes
• Definition of entropy by means of a coding problem
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Inequalities: theory of majorization and its applications