Building a data compression utility in Haskell using Huffman codes

Re:Building a data compression utility in Haskell using Huff... by lifthrasiir on Thursday July 04, 2024 @03:56AM (#40873162)

> In-Place Calculation of Minimum-Redundancy Codes

Or in general, refer to "On the Implementation of Minimum Redundancy Prefix Codes" by Moffat and Turpin (1997), as strongly recommended and later explained by Charles Bloom [1].

[1] https://cbloomrants.blogspot.com/2010/08/08-12-10-lost-huffm...

[ Parent | on HN ]

Re:Building a data compression utility in Haskell using Huff... by lazamar on Thursday July 04, 2024 @04:26AM (#40873294)

Thanks for the link. I was motivated to write the post after reading Moffat’s book ‘Managing Gigabytes’. A pearl from the 90’s.

The authors mention this technique in the second edition.

[ Parent | on HN ]