Bidirectional Huffman coding

DOI10.1093/COMJNL/33.4.296zbMATH Open1373.94859OpenAlexW2028386115MaRDI QIDQ4591397FDOQ4591397

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

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

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (9)

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

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)