Markov sources achieve the feedback capacity of finite-state machine channels

25 June 2003

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

Abstract

The feedback capacity of a finite-state machine channel is achieved by a feedback-dependent Markov source with the same memory length as the channel. The optimal feedback is captured by the conditional probabilities of the channel states given all previous channel outputs, i.e., by the forward coefficients in the Bahl, Cocke, Jelinek and Raviv (1974) algorithm. We formulate the optimization of the feedback-dependent Markov source distribution as an average-reward-per-stage stochastic control problem, and solve it numerically using dynamic programming algorithms.

Keywords

This publication has 2 references indexed in Scilit:

On the information rate of binary-input channels with memory
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
IEEE Transactions on Information Theory, 1974