Generating a canonical prefix encoding
From MaRDI portal
Publication:5340390
DOI10.1145/363958.363991zbMath0131.34405OpenAlexW2080702353MaRDI QIDQ5340390
Bruce Kallick, Eugene S. Schwartz
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
Related Items (13)
Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders ⋮ ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS ⋮ Worst-Case Optimal Adaptive Prefix Coding ⋮ A fast algorithm for adaptive prefix coding ⋮ Optimal skeleton and reduced Huffman trees ⋮ Optimal Skeleton Huffman Trees ⋮ Is Huffmann coding dead? ⋮ Optimal binary search trees ⋮ Efficient and compact representations of some non-canonical prefix-free codes ⋮ Forward looking Huffman coding ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions] ⋮ Space-efficient Huffman codes revisited ⋮ Optimum extensions of prefix codes.
This page was built for publication: Generating a canonical prefix encoding
