Eugene S. Schwartz
Abstract
Computer programs for generating a minimum-redundancy exhaustive prefix encoding are described. One program generates a Huffman frequency tree, another determines the structure functions of an encoding, and a third program assigns codes.
- 1 SHANNON, C. E. A mathematical theory of communication. Bell System Tech. J. 27 (1948), 379-423, 623-656.Google Scholar
- 2 FANO, R. M. Res. Lab. for Electronics, Mass. Inst. Technology, Techn. Rep. No. 65, 1949.Google Scholar
- 3 HUFFMAN, D. A. A method for the construction of minimumredundancy codes. Proc. IRE 40 (1952), 1098-1101.Google ScholarCross Ref
- 4 GILBERT, E. N. AND MOORE, E. F. Variable length binary encodings. Bell System Tech. J. 38 (1959), 933-967.Google ScholarCross Ref
- 5 KARP, R. S. Minimum-redundancy coding for the discrete noiseless channel. Trans. IRE, IT-7 (1961), 27-38.Google Scholar
- 6 SCHWARTZ, E. S. An adaptive information transmission system employing minimum-redundancy word codes. Armour Research Foundation, Techn. Doc. Bep. ASD-TDR-62- 265, Pt. 11, June 1963.Google Scholar
- 7 SCHWARTZ, E. S. An optimum encoding with minimum longest code and total number of digits. Inform. Contr. (to be published).Google Scholar
Index Terms
- Generating a canonical prefix encoding
Recommendations
Online prefix-free encoding algorithm
SPPRA'06: Proceedings of the 24th IASTED international conference on Signal processing, pattern recognition, and applicationsThe well-known Huffman encoding algorithm explicitly constructs the optimal codes. However, in the context of data communications, data encoded are usually online sent from one to another source. The Huffman algorithm is clearly inappropriate for online ...
Efficient and compact representations of some non-canonical prefix-free codes
AbstractFor many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when we can choose the order ...
A hybrid code compression technique using bitmask and prefix encoding with enhanced dictionary selection
CASES '07: Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systemsMemory is one of the most significant detrimental factors in increasing the cost and area of embedded systems, especially assemiconductor technology scales down. Code compression techniques have been employed to reduce the memory requirement of the ...
Comments