Bidirectional Huffman coding

DOI10.1093/COMJNL/33.4.296MaRDI QIDQ4591397zbMATH OpenOpenAlexFDO

Authors Aviezri S. Fraenkel, Shmuel T. Klein

Publication date 14 November 2017

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/33.4.296

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• An efficient decoding technique for Huffman codes
• scientific article; zbMATH DE number 1439476
• Bidirectional adaptive compression
• scientific article; zbMATH DE number 436071
• Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)

Cited in

(9)

• Bidirectional adaptive compression
• On the size of transducers for bidirectional decoding of prefix codes
• Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts
• Binary Huff Curves
• Binary Huffman equivalent codes with a short synchronizing codeword
• A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay
• Synchronizing dynamic Huffman codes
• Is Huffmann coding dead?
• Transducers for the bidirectional decoding of prefix codes

This page was built for publication: Bidirectional Huffman coding

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