Dynamic Huffman coding of subsets of arbitrary alphabets, Professor Vitter s invariant * for algorithm FGK. Includes a tree weight scaling interface-Dynamic Huffman coding of subsets of arbitrary alphabets, Professor Vitter s invariant * for algorit

Compression using Burrows Wheeler Transform. Includes n*log(n) comparison tri-partite suffix array block sorting, Move-to-Front coding, dynamic canonical Huffman coding of Wheeler s run-length-coding.