Error-correcting codes for automatic control

Rafail Ostrovsky*, Yuval Rabanit, Leonard J. Schulman

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
PublisherIEEE Computer Society
Pages309-316
Number of pages8
ISBN (Print)0769524680, 9780769524689
DOIs
StatePublished - 2005
Externally publishedYes
Event46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005 - Pittsburgh, PA, United States
Duration: 23 Oct 200525 Oct 2005

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume2005
ISSN (Print)0272-5428

Conference

Conference46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
Country/TerritoryUnited States
CityPittsburgh, PA
Period23/10/0525/10/05

Fingerprint

Dive into the research topics of 'Error-correcting codes for automatic control'. Together they form a unique fingerprint.

Cite this