Optimal Skeleton Huffman Trees Revisited

DOI10.1007/978-3-030-50026-9_20OpenAlexW3037747784MaRDI QIDQ5042248

Dmitry Kosolobov, Oleg Merkurev

Publication date: 19 October 2022

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.05239

zbMATH Keywords

dynamic programmingHuffman treeskeleton tree

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Optimal skeleton and reduced Huffman trees ⋮ Space-efficient Huffman codes revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Surpassing the information theoretic bound with fusion trees
• Code and parse trees for lossless source encoding
• A space efficient direct access data structure
• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• Self-synchronizing Huffman codes (Corresp.)
• Sources which maximize the choice of a Huffman coding tree
• Variations on a theme by Huffman
• Optimal Skeleton Huffman Trees
• A Method for the Construction of Minimum-Redundancy Codes

This page was built for publication: Optimal Skeleton Huffman Trees Revisited