BibTeX
@MISC{_onthe,
author = {},
title = {On the Implementation of Minimum Redundancy Prefix Codes},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of minimum redundancy coding, the majority based on the use of improved representations for explicit Huffman trees. In this paper, we examine how minimum redundancy coding can be implemented efficiently by divorcing coding from a code tree, with emphasis on the situation when � is large, perhaps on the order of 10 T. We review techniques for devising minimum redundancy codes, and consider in detail how encoding and decoding should be accomplished. In particular, we describe a modified decoding method that allows improved decoding speed, requiring just a few machine operations per output symbol (rather than for each decoded bit), and uses just a few hundred bytes of memory above and beyond the space required to store an enumeration of the source alphabet. Index Terms — Canonical code, Huffman code, length-limited code, minimum redundancy code, prefix code, text compression.
Keyphrases
minimum redundancy prefix code minimum redundancy code minimum redundancy coding prefix code index term canonical code machine operation data compression length-limited code huffman code many effort decoded bit code tree modified decoding method explicit huffman tree text compression output symbol abstract minimum redundancy coding improved representation source alphabet
