Re: Re[4]: [Haskell-cafe] Toy compression algorithms [was: A very edgy language]

G'day. Quoting Bulat Ziganshin :

what you mean by "flat" and "static" applied to PPM? static PPM models exist - they carry probabilities as separate table very like static Huffman encoding. is "flat" the same as order-0?

"Static" means that the frequency distribution is fixed. "Flat" means that the frequency histogram is flat. (Every code word is predicted to occur with the same frequency, resulting in a binary code.)

can you give a link? i never heard about such algorithm

http://en.wikipedia.org/wiki/Canonical_Huffman_code Cheers, Andrew Bromage