Optimal coding strategies for certain permuting channels
IEEE Transactions on Information Theory
Discrete-time controlled Markov processes with average cost criterion: a survey
SIAM Journal on Control and Optimization
Competitive Markov decision processes
Competitive Markov decision processes
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Dynamic Programming and Optimal Control, Vol. II
Dynamic Programming and Optimal Control, Vol. II
IEEE Transactions on Information Theory
The capacity of finite-State Markov Channels With feedback
IEEE Transactions on Information Theory
Graph capacities and zero-error transmission over compound channels
IEEE Transactions on Information Theory
Capacity of the Trapdoor Channel With Feedback
IEEE Transactions on Information Theory
Hi-index | 754.84 |
In this paper, we study the zero-error capacity for finite state channels with feedback when channel state information is known to both the transmitter and the receiver. We prove that the zero-error capacity in this case can be obtained through the solution of a dynamic programming problem. Each iteration of the dynamic programming provides lower and upper bounds on the zero-error capacity, and in the limit, the lower bound coincides with the zero-error feedback capacity. Furthermore, a sufficient condition for solving the dynamic programming problem is provided through a fixed-point equation. Analytical solutions for several examples are provided.