scientific article; zbMATH DE number 590411

MaRDI QIDQ4296162zbMATH OpenFDO

Authors Rafail E. Krichevsky

Publication date 15 June 1994

zbMATH Keywords

data compressionelementary universal setsinformation retrievalretrieval algorithmssource coding theory

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Information storage and retrieval of data (68P20) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 4104389
• A universal algorithm for sequential data compression
• scientific article; zbMATH DE number 3463524
• Universal data compression and repetition times
• Universal almost sure data compression

Cited in

(14)

• Universal retrieval trees
• On asymptotically optimal methods of prediction and adaptive coding for Markov sources
• Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form
• Information-theoretic approach to estimating the capacity of distributed memory systems
• Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
• scientific article; zbMATH DE number 4104389 (Why is no real title available?)
• On the efficiency and capacity of computers
• scientific article; zbMATH DE number 1021591 (Why is no real title available?)
• Probabilistic Models for Bacterial Taxonomy
• THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
• Time series prediction based on data compression methods
• Upper bounds on the numbers of binary plateaued and bent functions
• Universal codes as a basis for time series testing
• Constructing perfect steganographic systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296162)