Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,989,541 papers from all fields of science
Search
Sign In
Create Free Account
Krichevsky–Trofimov estimator
Known as:
Krichevsky-Trofimov estimator
In information theory, given an unknown stationary source π with alphabet A and a sample w from π, the Krichevsky–Trofimov (KT) estimator produces an…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Broader (1)
Data compression
Information theory
Regret (decision theory)
Stationary process
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Theoretical analysis of a zero-redundancy estimator with a finite window for memoryless source
M. M. Rashid
,
T. Kawabata
IEEE Information Theory Workshop, .
2005
Corpus ID: 16900527
A zero-redundancy estimator is defined by a weighted sum of Krichevsky-Trofimov (KT) sequential probability estimators i.e., the…
Expand
2005
2005
Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source
M. M. Rashid
,
T. Kawabata
IEICE Transactions on Fundamentals of Electronics…
2005
Corpus ID: 43901874
Prediction of actual symbol probability is crucial for statistical data compression that uses arithmetic coder. Krichevsky…
Expand
2005
2005
Redundancy of symbol decomposition algorithms for memoryless source
T. Kawabata
,
Y. Yanagisawa
Proceedings. International Symposium on…
2005
Corpus ID: 14775861
The symbol decomposition algorithm is proposed by Willems et. al. as an efficient and practical symbol predictor applicable for…
Expand
2003
2003
TROFIMOV G.Yu. Regimes of Growth and Economic Integration. Why Poor Countries Cannot Join the "Club" of Rich? — Moscow:
G. Trofimov
2003
Corpus ID: 156004550