https://hackerpaper.kaipfister.de/p/2108.05495/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=28168330urn:hackerpapers:mention:2108.05495:28168330Fri, 13 Aug 2021 13:02:47 GMT<p>&quot;Canonical Huffman code is an optimal prefix-free compression code whose codewords enumerated in the lexicographical order form a list of binary words in non-decreasing lengths. Gagie et al. (2015) gave a representation of this coding capable to encode or decode a symbol in constant worst case time. It uses σlgℓmax+o(σ)+O(ℓ2max) bits of space, where σ and ℓmax are the alphabet size and maximum codeword length, respectively. We refine their representation to reduce the space complexity to σlgℓmax(1+o(1)) bits while preserving the constant encode and decode times. Our algorithmic idea can be…</p><p><a href="https://hackerpaper.kaipfister.de/p/2108.05495/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DShttps://news.ycombinator.com/item?id=28168328urn:hackerpapers:submission:2108.05495:28168328Fri, 13 Aug 2021 13:02:47 GMT<p>Space-Efficient Huffman Codes Revisited</p><p></p><p>54 points; 13 discussion replies on HN. <a href="https://hackerpaper.kaipfister.de/p/2108.05495/">Paper and source history</a>. A submission is not an endorsement.</p>cs.DS