jm + finite-state-entropy-coding   1

Finite State Entropy coding
As can be guessed, the higher the compression ratio, the more efficient FSE becomes compared to Huffman, since Huffman can't break the "1 bit per symbol" limit. FSE speed is also very stable, under all probabilities. I'm quite please with the result, especially considering that, since the invention of arithmetic coding in the 70's, nothing really new has been brought to this field.

This is still beta stuff, so please consider this first release for testing purposes mostly.


Looking forward to this making it into a production release of some form.
compression  algorithms  via:kragen  fse  finite-state-entropy-coding  huffman  arithmetic-coding 
january 2014 by jm

Copy this bookmark:



description:


tags: