Prefix Codes: Equiprobable Words, Unequal Letter Costs
Mordecai Golin, Neal E. Young
Abstract
Describes a near-linear-time algorithm for a variant of Huffman coding, in which the letters may have non-uniform lengths (as in Morse code), but with the restriction that each word to be encoded has equal probability. [See also ``Huffman Coding with Unequal Letter Costs'' (2002).]
Create a lesson
Related papers
The Matching Number Characterizes the Query Complexity of Edge Counting and Degree Moment Estimation
Chenglin Fan, Wonseok Shin
Faster Deterministic Approximation for Counting Knapsack
Ce Jin, Jaewoo Park, Barna Saha
Many Scores Force Many Reads: An Optimality Proof for Score of Parentheses
Andrew Au
Constructive Arboricity in Almost-Linear Time for Dense Graphs
Iman Gholami, Mohammad T. Hajiaghayi, Mahdi JafariRaviz et al.
Tight asymptotic competitive ratio for the Canadian Traveller Problem on unit-weighted grids
Pierre Bergé, Vsevolod Chernyshev, Malory Marin et al.
Breaking Two Barriers for Dynamic Planar Reachability
Adam Karczmarz, Michał Włodarczyk