Skip to main content

A New Data Compression Technique

  • Chapter
Annals of Systems Research

Part of the book series: Annals of Systems Research ((ASRE,volume 6))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Huffman, David A., A method for the construction of minimum redundancy codes. Proceedings of the Institute of Radio Engineers 40, 1952, 1098–1101.

    Article  Google Scholar 

  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. Feinstein, A., Foundations of information theory, New York,1958.

    MATH  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  5. Knuth, Donald E., The art of computer programming, Vol. 1 and 3, Reading (Mass.) 1969.

    Google Scholar 

  6. Lynch, Michael F., Compression of bibliographical files using an adaptation of run-length coding. Information storage and retrieval 9, 1973, 207–214.

    Article  Google Scholar 

  7. Shannon, Claude E. and Weaver, Warren, The mathematical theory of communication, Urbana, 1949.

    MATH  Google Scholar 

  8. Ruth, S. S., and Kreutzer, P. J., Data compression for large business files. Datamation 18, 1972, 62–66.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

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

About this chapter

Cite this chapter

Verhoeff, J. (1977). A New Data Compression Technique. In: Van Rootselaar, B., Koppelaar, H. (eds) Annals of Systems Research. Annals of Systems Research, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-4074-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-4074-4_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-90-207-0731-1

  • Online ISBN: 978-1-4613-4074-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics