Deterministic coding for interactive communication
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Communication on noisy channels: a coding theorem for computation
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Coding for interactive communication
IEEE Transactions on Information Theory - Part 1
| Hi-index | 0.00 |
In many control-theory applications one can classify all possible states of the device by an infinite state graph with polynomially-growing expansion. In order for a controller to control or estimate the state of such a device, it must receive reliable communications from its sensors; if there is channel noise, the encoding task is subject to a stringent real-time constraint. We show a constructive on-line error correcting code that works for this class of applications. Our code is is computationally efficient and enables on-line estimation and control in the presence of channel noise. It establishes a constructive (and optimal-within-constants) analog, for control applications, of the Shannon coding theorem.