Generating a canonical prefix encoding

DOI10.1145/363958.363991MaRDI QIDQ5340390zbMATH OpenOpenAlexFDO

Authors Eugene S. Schwartz, Bruce Kallick

Publication date 1964

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/363958.363991

zbMATH Keywords

numerical analysis

Cited in

(15)

• Is Huffmann coding dead?
• Optimal skeleton Huffman trees
• Optimal skeleton and reduced Huffman trees
• Optimum extensions of prefix codes.
• Worst-Case Optimal Adaptive Prefix Coding
• Efficient and compact representations of some non-canonical prefix-free codes
• Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders
• Space-efficient Huffman codes revisited
• Forward looking Huffman coding
• Optimal binary search trees
• Selective dynamic compression
• Synchronizing dynamic Huffman codes
• A fast algorithm for adaptive prefix coding
• Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
• Fast scalable construction of ([compressed] static | minimal perfect hash) functions

This page was built for publication: Generating a canonical prefix encoding

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