A New Data Compression Technique
By coding fixed-length blocks of symbols from an information source with a minimum redundancy (the variable-length Huffman code) the source entropy is approached as a function of the block size. In the present paper it is shown that it is also possible to split the source output into variable-length blocks which can be coded with a fixed-length code such that the efficiency also converges to the entropy of the source. An algorithm for optimal splitting is given, as well as a proof of the convergence.
KeywordsInternal Node Maximal Tree Minimum Redundancy Prefix Code Source Output
Unable to display preview. Download preview PDF.
- 2.Sardinas, A. and Patterson, G., A necessary and sufficient condition for unique decomposition of coded messages. Institute of Radio Engineers convention record part 8, 1953, 104–108.Google Scholar
- 5.Knuth, Donald E., The art of computer programming, Vol. 1 and 3, Reading (Mass.) 1969.Google Scholar
- 8.Ruth, S. S., and Kreutzer, P. J., Data compression for large business files. Datamation 18, 1972, 62–66.Google Scholar