scientific article; zbMATH DE number 590411
From MaRDI portal
Publication:4296162
zbMath0832.68038MaRDI QIDQ4296162
Publication date: 15 June 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
data compressioninformation retrievalsource coding theoryelementary universal setsretrieval algorithms
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Information storage and retrieval of data (68P20) Source coding (94A29)
Related Items (11)
Probabilistic Models for Bacterial Taxonomy ⋮ On the efficiency and capacity of computers ⋮ Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form ⋮ THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES ⋮ Time series prediction based on data compression methods ⋮ Universal codes as a basis for time series testing ⋮ Constructing perfect steganographic systems ⋮ Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series ⋮ Information-theoretic approach to estimating the capacity of distributed memory systems ⋮ Unnamed Item ⋮ On asymptotically optimal methods of prediction and adaptive coding for Markov sources
This page was built for publication:
