scientific article; zbMATH DE number 436071
From MaRDI portal
Publication:3139856
zbMATH Open0798.94014MaRDI QIDQ3139856FDOQ3139856
Authors: David R. McIntyre, Francis G. Wolff 
Publication date: 11 November 1993
Title of this publication is not available (Why is that?)
Recommendations
Cited In (12)
- Optimal skeleton Huffman trees
- Optimal skeleton and reduced Huffman trees
- An efficient bitwise Huffman coding technique based on source mapping.
- Bidirectional Huffman coding
- Generation of fast interpreters for Huffman compressed bytecode
- Effect of file size, entropy and alphabet size on Huffman algorithm performance
- Huffman coding in bit-vector compression
- Constructing binary Huffman tree
- Fast tabular decoding method for multi-delimiter codes
- Title not available (Why is that?)
- Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)
- A space-efficient Huffman decoding algorithm and its parallelism
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139856)
