Alphabetic coding with exponential costs

DOI10.1016/j.ipl.2009.11.008zbMath1206.68365arXivcs/0605099OpenAlexW2004107401MaRDI QIDQ990132

Michael B. Baer

Publication date: 2 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0605099

zbMATH Keywords

dynamic programminginformation retrievalapproximation algorithmsRényi entropytree searching

Mathematics Subject Classification ID

Dynamic programming (90C39) Approximation algorithms (68W25)

Related Items (2)

Operations research applications of dichotomous search ⋮ On the Huffman and alphabetic tree problem with general cost functions

Cites Work

• Optimum binary search trees
• Bounds on the redundancy of binary alphabetical codes
• Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
• Conditions for Optimality of the Huffman Algorithm
• Binary Trees Optimum Under Various Criteria
• A Method for the Construction of Minimum-Redundancy Codes
• A coding theorem and Rényi's entropy
• Definition of entropy by means of a coding problem
• Unnamed Item

This page was built for publication: Alphabetic coding with exponential costs