A New Data Compression Technique

  • J. Verhoeff
Part of the Annals of Systems Research book series (ASRE, volume 6)


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.


Internal Node Maximal Tree Minimum Redundancy Prefix Code Source Output 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Huffman, David A., A method for the construction of minimum redundancy codes. Proceedings of the Institute of Radio Engineers 40, 1952, 1098–1101.CrossRefGoogle Scholar
  2. 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
  3. 3.
    Feinstein, A., Foundations of information theory, New York,1958.MATHGoogle Scholar
  4. 4.
    Hu, T. C. and Tucker, A. C., Optimal computer search trees and variable-length alphabetical codes. Siam Journal of Applied Mathematics, 21 No 4, 1971, 514–532.CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Knuth, Donald E., The art of computer programming, Vol. 1 and 3, Reading (Mass.) 1969.Google Scholar
  6. 6.
    Lynch, Michael F., Compression of bibliographical files using an adaptation of run-length coding. Information storage and retrieval 9, 1973, 207–214.CrossRefGoogle Scholar
  7. 7.
    Shannon, Claude E. and Weaver, Warren, The mathematical theory of communication, Urbana, 1949.MATHGoogle Scholar
  8. 8.
    Ruth, S. S., and Kreutzer, P. J., Data compression for large business files. Datamation 18, 1972, 62–66.Google Scholar

Copyright information

© H. E. Stenfert Kroese B.V./Leiden — The Netherlands 1977

Authors and Affiliations

  • J. Verhoeff

There are no affiliations available

Personalised recommendations