We resolve the fundamental problem of online decoding with general n th order ergodic Markov chain models.
we provide deterministic and randomized algorithms whose performance is close to that of the optimal offline algorithm even when latency is small.