Optimal causal coding - decoding problems

Abstract

The symbols produced by a finite Markov source are causally encoded so as to be transmitted through a noisy memoryless channel. The encoder is assumed to have channel feedback information and the decoder to be causal. The feedback information is shown to be useful in general. Separation results are derived and used to prove that encoding is useless for a class of symmetric channels.