Optimal skeleton and reduced Huffman trees

DOI10.1016/J.TCS.2020.11.025zbMath1477.68105OpenAlexW3104462311MaRDI QIDQ2220839

Tamar C. Serebro, Jakub Radoszewski, Shmuel T. Klein, Dana Shapira

Publication date: 25 January 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.11.025

zbMATH Keywords

data compressionHuffman treereduced skeletonskeleton tree

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random access to Fibonacci encoded files
• A space efficient direct access data structure
• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• Alphabet Partitioning for Compressed Rank/Select and Applications
• Basic Concepts in Data Structures
• Self-synchronizing Huffman codes (Corresp.)
• Sources which maximize the choice of a Huffman coding tree
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Optimal Skeleton Huffman Trees Revisited
• Optimal Skeleton Huffman Trees
• Practical Entropy-Compressed Rank/Select Dictionary
• Generating a canonical prefix encoding
• A Method for the Construction of Minimum-Redundancy Codes

This page was built for publication: Optimal skeleton and reduced Huffman trees