Skip to content

Comment on Modern LZ Compression (2019)parent

Comments

Arithmetic coding can be implemented in as little as maybe ten lines of code. It is far simpler than Huffman coding.

The Huffman encoding loop is 2 lines and decoding loop is 4 lines of branchless code. Do you have an example of branchless arithmetic encoder or decoder ?

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.