The following pages link to Finitary Codes, a short survey (Q5307917):
Displaying 22 items.
- A monotone Sinai theorem (Q272941) (← links)
- On the marker method for constructing finitary isomorphisms (Q422025) (← links)
- A monotone isomorphism theorem (Q525106) (← links)
- The conjugacy problem in ergodic theory (Q640773) (← links)
- Poisson splitting by factors (Q651009) (← links)
- Finitary isomorphisms of Brownian motions (Q782411) (← links)
- Finitary codings for spatial mixing Markov random fields (Q784183) (← links)
- On processes which cannot be distinguished by finite observation (Q940747) (← links)
- Natural coefficients and invariants for Markov-shifts (Q1057380) (← links)
- Coding Markov chains from the past (Q1196317) (← links)
- A class of finitary codes (Q1239131) (← links)
- Code length between Markov processes (Q1806254) (← links)
- Constructing finitary isomorphisms with finite expected coding times (Q1860715) (← links)
- Finitary isomorphisms of renewal point processes and continuous-time regenerative processes (Q2164439) (← links)
- Notes on finitary isomorphism markers in countable state Markov processes (Q2869742) (← links)
- Universal finitary codes with exponential tails (Q3434058) (← links)
- Notes on Coding Problems for Finite State Processes (Q3978864) (← links)
- An example of a weak Bernoulli process which is not finitary (Q4712440) (← links)
- Some factors of nonsingular Bernoulli shifts (Q5015419) (← links)
- A factor of i.i.d. with uniform marginals and infinite clusters spanned by equal labels (Q6068420) (← links)
- Isomorphisms of Poisson systems over locally compact groups (Q6183249) (← links)
- Sinai factors of nonsingular systems: Bernoulli shifts and Anosov flows (Q6632080) (← links)
