The performance of universal encoding
From MaRDI portal
Publication:3924088
DOI10.1109/TIT.1981.1056331zbMath0469.94004OpenAlexW4376453175WikidataQ105584070 ScholiaQ105584070MaRDI QIDQ3924088
V. K. Trofimov, Rafail E. Krichevsky
Publication date: 1981
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1981.1056331
Related Items
Predictive stochastic complexity and model estimation for finite-state processes, Entropy estimation of symbol sequences, Jeffreys' prior is asymptotically least favorable under entropy risk, A novel Chow-Liu algorithm and its application to gene differential analysis, Stochastic complexity in learning, Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes, On model selection, Bayesian networks, and the Fisher information integral, An efficient Bayesian network structure learning strategy, Unnamed Item, Generalized Good-Turing Improves Missing Mass Estimation, Bayesian approach to LR assessment in case of rare type match, Impact of Model Choice on LR Assessment in Case of Rare Haplotype Match (Frequentist Approach), Sequential network change detection with its applications to ad impact relation analysis, Large-scale network motif analysis using compression, Unnamed Item, Unnamed Item, Estimating Entropy Rates with Bayesian Confidence Intervals, Joint Estimation of Intersecting Context Tree Models, Individual redundancy of adaptive and weighted source coding, Universal coding algorithm for a family of context Markov sources, A lower bound on compression of unknown alphabets, Clustering of modal-valued symbolic data, Testing exchangeability: fork-convexity, supermartingales and e-processes, Consistency of the BIC order estimator, The consistency of the BIC Markov order estimator., Some results on tries with adaptive branching., Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy, Universal coding for memoryless sources with countably infinite alphabets, Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
