Optimal Skeleton Huffman Trees

DOI10.1007/978-3-319-67428-5_21zbMath1454.68033OpenAlexW2751687613MaRDI QIDQ5150936

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

Publication date: 16 February 2021

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-67428-5_21

Mathematics Subject Classification ID

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

Related Items (2)

Optimal Skeleton Huffman Trees Revisited ⋮ Optimal skeleton and reduced Huffman trees

Cites Work

• Unnamed Item
• 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.)
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• 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 Huffman Trees