Optimal Skeleton Huffman Trees Revisited

DOI10.1007/978-3-030-50026-9_20MaRDI QIDQ5042248zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• A space efficient direct access data structure
• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• Code and parse trees for lossless source encoding
• scientific article; zbMATH DE number 3558968 (Why is no real title available?)
• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• Optimal skeleton Huffman trees
• Self-synchronizing Huffman codes (Corresp.)
• Sources which maximize the choice of a Huffman coding tree
• Surpassing the information theoretic bound with fusion trees
• Variations on a theme by Huffman

Cited in

(3)

• Space-efficient Huffman codes revisited
• Optimal skeleton and reduced Huffman trees
• On the linear description of the Huffman trees polytope

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042248)