Universal Compression and Retrieval

  • Rafail¬†Krichevsky

Part of the Mathematics and Its Applications book series (MAIA, volume 274)

Table of contents

  1. Front Matter
    Pages i-viii
  2. Rafail Krichevsky
    Pages 1-3
  3. Rafail Krichevsky
    Pages 4-7
  4. Rafail Krichevsky
    Pages 8-26
  5. Rafail Krichevsky
    Pages 27-73
  6. Rafail Krichevsky
    Pages 74-108
  7. Rafail Krichevsky
    Pages 109-134
  8. Rafail Krichevsky
    Pages 135-174
  9. Rafail Krichevsky
    Pages 175-208
  10. Back Matter
    Pages 209-223

About this book

Introduction

Objectives Computer and communication practice relies on data compression and dictionary search methods. They lean on a rapidly developing theory. Its exposition from a new viewpoint is the purpose of the book. We start from the very beginning and finish with the latest achievements of the theory, some of them in print for the first time. The book is intended for serving as both a monograph and a self-contained textbook. Information retrieval is the subject of the treatises by D. Knuth (1973) and K. Mehlhorn (1987). Data compression is the subject of source coding. It is a chapter of information theory. Its up-to-date state is presented in the books of Storer (1988), Lynch (1985), T. Bell et al. (1990). The difference between them and the present book is as follows. First. We include information retrieval into source coding instead of discussing it separately. Information-theoretic methods proved to be very effective in information search. Second. For many years the target of the source coding theory was the estimation of the maximal degree of the data compression. This target is practically bit today. The sought degree is now known for most of the sources. We believe that the next target must be the estimation of the price of approaching that degree. So, we are concerned with trade-off between complexity and quality of coding. Third. We pay special attention to universal families that contain a good com­ pressing map for every source in a set.

Keywords

Boolean function Moore Shannon algorithms communication complexity computer computer science data compression database database design entropy information information theory theoretical computer science

Authors and affiliations

  • Rafail¬†Krichevsky
    • 1
  1. 1.Institute of Mathematics, Russian Academy of SciencesNovosibirsk State UniversityNovosibirskRussia

Bibliographic information

  • DOI https://doi.org/10.1007/978-94-017-3628-2
  • Copyright Information Springer Science+Business Media B.V. 1994
  • Publisher Name Springer, Dordrecht
  • eBook Packages Springer Book Archive
  • Print ISBN 978-90-481-4357-3
  • Online ISBN 978-94-017-3628-2
  • About this book