Pages that link to "Item:Q4008332"
From MaRDI portal
The following pages link to A sequential algorithm for the universal coding of finite memory sources (Q4008332):
Displaying 14 items.
- The power of amnesia: Learning probabilistic automata with variable memory length (Q676238) (← links)
- Distributions of pattern statistics in sparse Markov models (Q778872) (← links)
- Universal coding for discrete memoryless sources uniform with respect to output (Q809982) (← links)
- Predictive stochastic complexity and model estimation for finite-state processes (Q1330228) (← links)
- Relevant states and memory in Markov chain bootstrapping and simulation (Q1752182) (← links)
- Variable length Markov chains (Q1970475) (← links)
- Universal coding algorithm for a family of context Markov sources (Q2263012) (← links)
- Information-Theoretic Caching: Sequential Coding for Computing (Q2976520) (← links)
- A unique ranking of multilevel sequences and its application to source coding (Corresp.) (Q3689084) (← links)
- A universal variable-to-fixed length source code based on Lawrence's algorithm (Q3990761) (← links)
- A universal algorithm for sequential data compression (Q4158937) (← links)
- Lempel-Ziv complexity analysis of one dimensional cellular automata (Q4591802) (← links)
- Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity (Q4879987) (← links)
- Computation of exact probabilities associated with overlapping pattern occurrences (Q6600377) (← links)