News for hackers. Stuff that matters.

A comment on Building a data compression utility in Haskell using Huffman codes. Parent comment

Re:Building a data compression utility in Haskell using Huff... by lifthrasiir on Thursday July 04, 2024 @03:59AM (#40873179)
Huffman codes are conceptually isomorphic to arithmetic codes where all probabilities are 2^-k with k integer, so they have an obvious disadvantage due to more inaccurate symbol distribution.
[ Parent | on HN ]
Re:Building a data compression utility in Haskell using Huff... by SassyBird on Thursday July 04, 2024 @06:42AM (#40873855)
Hopefully k is natural. ;)
[ Parent | on HN ]
Re:Building a data compression utility in Haskell using Huff... by lifthrasiir on Thursday July 04, 2024 @08:05AM (#40874211)
Implied because any symbol distribution which probabilities do not sum to 1 is invalid anyway ;-)
[ Parent | on HN ]