Decoding of Canonical Huffman Codes with Look-Up Tables

@inproceedings{Nekrich2000DecodingOC,
  title={Decoding of Canonical Huffman Codes with Look-Up Tables},
  author={Yakov Nekrich},
  booktitle={Data Compression Conference},
  year={2000}
}
This paper presents an e cient algorithm for decoding canonical Hu man codes with look-up tables. Canonical codes are a subclass of Hu man codes, that have a numerical sequence property, i.e. codewords with the same length are binary representations of consecutive integers. In case of decoding with look-up tables we read a number of bits at each step of decoding process. We look-up the value of read bit sequence in a table and, if this bit sequence contains a codeword, we output the… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS
13 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

Similar Papers

Loading similar papers…