Pages that link to "Item:Q1112787"
From MaRDI portal
The following pages link to Universal sequential coding of single messages (Q1112787):
Displaying 13 items.
- Twice-universal coding (Q1059045) (← links)
- Methods of constructing lower bounds for redundancy of universal coding (Q1172042) (← links)
- Predicting a binary sequence almost as well as the optimal biased coin (Q1398365) (← links)
- Aim functions and sequential estimation of the source model for universal coding (Q1582958) (← links)
- Relative expected instantaneous loss bounds (Q1604219) (← links)
- A lower bound on compression of unknown alphabets (Q1770393) (← links)
- Joint matrix universal coding of sequences of independent symbols (Q1812353) (← links)
- Adaptive game playing using multiplicative weights (Q1818286) (← links)
- Multi-alphabet universal coding of memoryless sources (Q1925351) (← links)
- Sequential universal modeling for non-binary sequences with constrained distributions (Q2155950) (← links)
- Adaptive compression against a countable alphabet (Q2920856) (← links)
- Statistical Problem Classes and Their Links to Information Theory (Q5080449) (← links)
- Number of hidden states and memory: a joint order estimation problem for Markov chains with Markov regime (Q5851010) (← links)