News for hackers. Stuff that matters.
Re:Modern LZ Compression (2019) by user-the-name on Wednesday August 18, 2021 @02:07PM (#28224942)
Arithmetic coding can be implemented in as little as maybe ten lines of code. It is far simpler than Huffman coding.
Re:Modern LZ Compression (2019) by hexxagone on Wednesday August 18, 2021 @08:27PM (#28228945)
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 ?