Opening book details…
Can I read Space-efficient Huffman codes revisited on EtoBox?
Space-efficient Huffman codes revisited by Szymon Grabowski; Dominik Köppl is a Computer Science article available to read on EtoBox.
What is Space-efficient Huffman codes revisited about?
A 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 of encoding and decoding a symbol in constant worst-case time. It uses σ lg l max + o ( σ ) + O ( l max 2 ) bits of space, where σ and l max are the alphabet size and maximum codeword length, respectively. We refine their representation to reduce the space complexity to σ lg l max ( 1 + o ( 1 ) ) bits while preserving the constant encode and decode times. Our algorithmic idea can be applied to any canonical code.
Who reads Space-efficient Huffman codes revisited?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Szymon Grabowski; Dominik Köppl
- Publisher
- Elsevier BV
- Published
- 2023
- Language
- EN
- Field
- Computer Science (Physical Sciences)