Fast Huffman codebook generator

Generates Huffman codewords based on input alphabet and character probabilites.

An implementation that builds a set of Huffman codes given an input alphabet with character probabilities. Does the same as the Matlab function huffmandict.m, but is a lot faster for larger alphabets. The function can as of version 2.0 be used with huffmanenco.m and huffmandeco.m. Please do note that it will only accept an input with two variables, and that it will not always generate the exact same dictionary as huffmandict.m (Huffman dictionaries are optimal but not uniquely defined).