---

＜E-Book＞
Universal Compression and Retrieval / by R. Krichevsky
(Mathematics and Its Applications ; 274)

Edition	1st ed. 1994.
Publisher	(Dordrecht : Springer Netherlands : Imprint: Springer)
Year	1994
Language	English
Size	VIII, 224 p : online resource
Authors	*Krichevsky, R author SpringerLink (Online service)
Subjects	LCSH:Coding theory LCSH:Information theory LCSH:Computer science -- Mathematics  All Subject Search LCSH:Discrete mathematics LCSH:Electrical engineering LCSH:Plants -- Evolution  All Subject Search FREE:Coding and Information Theory FREE:Discrete Mathematics in Computer Science FREE:Electrical and Electronic Engineering FREE:Plant Evolution
Notes	Nomenclature -- 1 Information Source and Entropy -- 2 Source Coding -- 3 Universal Codes -- 4 Universal Sets of Compressing Maps -- 5 Elementary Universal Sets -- 6 Optimal Numerator -- Appendix 1 -- Appendix 2 -- References 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 HTTP:URL=https://doi.org/10.1007/978-94-017-3628-2

 Similar Items