Universal sequential coding of single messages
From MaRDI portal
Publication:1112787
zbMath0659.94009MaRDI QIDQ1112787
Publication date: 1988
Published in: Problems of Information Transmission (Search for Journal in Brave)
Markov chainsMarkov sourcescoding redundancy of single messagesmemoryless sourcessequential coding of messages
Related Items
Statistical Problem Classes and Their Links to Information Theory, Predicting a binary sequence almost as well as the optimal biased coin, A lower bound on compression of unknown alphabets, Adaptive game playing using multiplicative weights, Number of hidden states and memory: a joint order estimation problem for Markov chains with Markov regime, Relative expected instantaneous loss bounds
