Research Catalog

Title

Universal compression and retrieval / by Rafail Krichevsky.

Author

Krichevskiĭ, R. E. (Rafail Evseevich)

Publication

Dordrecht ; Boston : Kluwer Academic, [1994], ©1994.

Items in the Library & Off-site

Holdings

Details

Series Statement

Mathematics and its applications ; 274

Uniform Title

Mathematics and its applications (Kluwer Academic Publishers) ; v. 274.

Subject

• Data compression (Computer science)
• Data compression (Telecommunication)
• Information storage and retrieval systems

Bibliography (note)

• Includes bibliographical references (p. 213-217) and index.

Contents

• 1. Information Source and Entropy. 1.1. Finite Combinatorial Sources. 1.2. Epsilon-entropy. 1.3. Stochastic Sources. 1.4. Stationary Stochastic Sources. 1.5. Stationary Combinatorial Sources and Jablonskii Invariant Classes -- 2. Source Coding. 2.1. Types of Codes. 2.2. Kraft Inequality and Levenstein Code. 2.3. Encoding of Combinatorial Sources. 2.4. Hashing. 2.5. Encoding of Individual Words and Stochastic Sources. 2.6. Equiprobable Letters and Threshold Functions. 2.7. Stationary Sources. 2.8. Kolmogorov Complexity. 2.9. Majorizing the Kolmogorov Complexity -- 3. Universal Codes. 3.1. Encoding of Sets of Stochastic Sources. 3.2. Block-to Variable Length Encoding of Bernoulli Sources. 3.3. Variable-Length-to-Block Encoding of Bernoulli Sources. 3.4. Adaptive Encoding. 3.5. Monotone Sources. 3.6. Universal Encoding of Combinatorial Sources. 3.7. Universal Encoding of Stationary Sources -- 4. Universal Sets of Compressing Maps. 4.1. Definition of Universal Set. 4.2. Covering Lemma.
• 4.3. Cluster Distribution. 4.4. Large Deviations Probabilities. 4.5. Universal Numerator. 4.6. Universal Hash - Sets. 4.7. Piercing Sets and Independent Sets -- 5. Elementary Universal Sets. 5.1. Universal Sets Based on Codes. 5.2. Linear Galois Hashing. 5.3. Polynomial Galois Hashing. 5.4. String Matching. 5.5. Digital Retrieval. 5.6. Digital Calculation of Boolean Functions. 5.7. Lexicographic Retrieval. 5.8. Enumerative Retrieval -- 6. Optimal Numerator. 6.1. Lexicographic-Polynomial Partitions. 6.2. Multilevel Galois Partitions. 6.3. Partition-Numerator Interface. 6.4. Low Redundant Numerators. 6.5. Highly Redundant Numerators. 6.6. Channels with Arbitrary Additive Noise. 6.7. Partial Boolean Functions, Piercing and Independent Sets, Threshold Formulas. 6.8. Short Tables for Rapid Computation of Lipschitz Functions.

ISBN

0792326725 (alk. paper)

LCCN

93045682

OCLC

• 29521025
• ocm29521025

Owning Institutions

Columbia University Libraries