A New Algorithm for Building Alphabetic Minimax Trees

Details A New Algorithm for Building Alphabetic Minimax Trees A New Algorithm for Building Alphabetic Minimax Trees

2008-10-28

arxiv.org/abs/0810.5064v1

Computer Science

Information Theory

in preparation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A New Algorithm for Building Alphabetic Minimax Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A New Algorithm for Building Alphabetic Minimax Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Algorithm for Building Alphabetic Minimax Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486072