Krichevsky | Universal Compression and Retrieval | Buch | 978-90-481-4357-3 | sack.de

Buch, Englisch, 224 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 359 g

Reihe: Mathematics and Its Applications

Krichevsky

Universal Compression and Retrieval


1. Auflage. Softcover version of original hardcover Auflage 1994
ISBN: 978-90-481-4357-3
Verlag: Springer Netherlands

Buch, Englisch, 224 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 359 g

Reihe: Mathematics and Its Applications

ISBN: 978-90-481-4357-3
Verlag: Springer Netherlands


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.

Krichevsky Universal Compression and Retrieval jetzt bestellen!

Zielgruppe


Research


Autoren/Hrsg.


Weitere Infos & Material


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.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.