A New Algorithm for Building Alphabetic Minimax Trees
Information Theory
2008-10-29 v1 Data Structures and Algorithms
math.IT
Abstract
We show how to build an alphabetic minimax tree for a sequence (W = w_1, >..., w_n) of real weights in (O (n d \log \log n)) time, where is the number of distinct integers (\lceil w_i \rceil). We apply this algorithm to building an alphabetic prefix code given a sample.
Keywords
Cite
@article{arxiv.0810.5064,
title = {A New Algorithm for Building Alphabetic Minimax Trees},
author = {Travis Gagie},
journal= {arXiv preprint arXiv:0810.5064},
year = {2008}
}
Comments
in preparation