A New Algorithm for Building Alphabetic Minimax Trees
classification
💻 cs.IT
cs.DSmath.IT
keywords
alphabeticalgorithmbuildingminimaxapplybuildcodedistinct
read the original 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 $d$ is the number of distinct integers (\lceil w_i \rceil). We apply this algorithm to building an alphabetic prefix code given a sample.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.