The performance of universal encoding

Authors:
R. Krichevsky;V. Trofimov
Affiliations:
-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

Scalable algorithms for mining large databases

KDD '99 Tutorial notes of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Detecting changes of clustering structures using normalized maximum likelihood coding

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Coding of non-stationary sources as a foundation for detecting change points and outliers in binary time-series

AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
Individual redundancy of adaptive and weighted source coding

Problems of Information Transmission

Quantified Score

Hi-index	754.84

Visualization

Abstract

Universal coding theory is surveyed from the viewpoint of the interplay between delay and redundancy. The price for universality turns out to be acceptably small.