Skip to main content
Book cover

Sequences II pp 104–117Cite as

Adaptive Lossless Data Compression over a Noisy Channel

  • Conference paper
  • 193 Accesses

Abstract

With dynamic communication a sender and receiver work in a “lock-step” cooperation to maintain identical copies of a dictionary D (which is constantly changing). A key application of dynamic communication is adaptive data compression. A potential drawback of dynamic communication is error propagation (that causes the sender and receiver dictionaries to diverge and possibly corrupt all data to follow). Protocols that require the receiver to request re-transmission from the sender when an error is detected can be impractical for many applications where such two way communication is not possible or self-defeating (e.g., with data compression, re-transmission is tantamount to losing the data that could have been transmitted in the mean time). We present a new model of error resilient communication where even though errors may not be detected, there are strong guarantees that their effects will not propagate.

Keywords

  • Data Compression
  • Encode Algorithm
  • Dynamic Communication
  • Decode Algorithm
  • Pointer Pair

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-1-4613-9323-8_9
  • Chapter length: 14 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   59.99
Price excludes VAT (USA)
  • ISBN: 978-1-4613-9323-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   79.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • T. Hagerup and C. Rub [ 1989 ]. “A Guided Tour of Chernoff Bounds”, Information Processing Letters 33, 305–308.

    CrossRef  Google Scholar 

  • A. Lempel and J. Ziv [ 1976 ]. “On the Complexity of Finite Sequences”, IEEE Transactions on Information Theory 22: 1, 75–81.

    MathSciNet  MATH  CrossRef  Google Scholar 

  • V. S. Miller and M. N. Wegman [ 1985 ]. “Variations on a Theme by Lempel and Ziv”, Combinatorial Algorithms on Words, Springer-Verlag (A. Apostolico and Z. Galil, editors ), 131–140.

    Google Scholar 

  • J. Reif and J. A. Storer [ 1990 ]. “A Parallel Architecture for High Speed Data Compression”, Proceedings Third Symposium on the Frontiers of Massively Parallel Computation, College Park, MD.

    Google Scholar 

  • J. A. Storer [ 1988 ]. Data Compression: Methods and Theory, Computer Science Press, Rockville, MD.

    Google Scholar 

  • J. A. Storer and T. G. Szymanski [ 1978 ]. “The Macro Model for Data Compression”, Proceedings Tenth Annual ACM Symposium on the Theory of Computing, San Diego, CA, 30–39.

    Google Scholar 

  • T. A. Welch [ 1984 ]. “A Technique for High-Performance Data Compression”, IEEE Computer 17: 6, 8–19.

    Google Scholar 

  • J. Ziv and A. Lempel [ 1977 ]. “A Universal Algorithm for Sequential Data Compression”, IEEE Transactions on Information Theory 23: 3, 337–343.

    MathSciNet  MATH  CrossRef  Google Scholar 

  • J. Ziv and A. Lempel [ 1978 ]. “Compression of Individual Sequences Via Variable-Rate Coding”, IEEE Transactions on Information Theory 24: 5, 530–536.

    MathSciNet  MATH  CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1993 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Storer, J.A., Reif, J.H. (1993). Adaptive Lossless Data Compression over a Noisy Channel. In: Capocelli, R., De Santis, A., Vaccaro, U. (eds) Sequences II. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9323-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-9323-8_9

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4613-9325-2

  • Online ISBN: 978-1-4613-9323-8

  • eBook Packages: Springer Book Archive