Alex Vinokur

Learn More
A non-decreasing sequence of positive integer weights P ={p 1 , p 2 ,…, p n } (n = N*(m-1) + 1, N is number of non-leaves of m-ary tree) is called absolutely ordered if the intermediate sequences of weights produced by m-ary Huffman algorithm for initial sequence P on i-th step satisfy the following conditions 2 , ,) (1) (− = < + N 0 i p p i m i m. Let T be(More)
  • 1