Error-correcting codes for automatic control

Authors:
Rafail Ostrovsky;Yuval Rabani;Leonard J. Schulman
Affiliations:
Computer Science Department and Department of Mathematics, University of California, Los Angeles, Los Angeles, CA;Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel;California Institute of Technology, Pasadena, CA
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 5
Cited 1

Deterministic coding for interactive communication

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Online robots and the remote museum experience

Beyond webcams
An improvement of the tree code construction

Information Processing Letters
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

Tree codes and a conjecture on exponential sums

Proceedings of the 5th conference on Innovations in theoretical computer science

Quantified Score

Hi-index	754.84

Visualization

Abstract

Systems with automatic feedback control may consist of several remote devices, connected only by unreliable communication channels. It is necessary in these conditions to have a method for accurate, real-time state estimation in the presence of channel noise. This problem is addressed, for the case of polynomial-growth-rate state spaces, through a new type of error-correcting code that is online and computationally efficient. This solution establishes a constructive analog, for some applications in estimation and cuntrol, of the Shannon coding theorem.