Abstract | ||
---|---|---|
In many control-theory applications one can classify all po ssible states of the device by an infinite state graph with polynomially-growing expansion. In orderfor a controller to control or estimate the state of such a device, it must receive reliable communicati ons from its sensors; if there is channel noise, the encoding task is subject to a stringent real-time constr aint. We show a constructive on-line error correcting code that works for this class of applications. O ur code is is computationally efficient and enables on-line estimation and control in the presence of ch annel noise. It establishes a constructive (and optimal-within-constants) analog, for control appli cations, of the Shannon coding theorem. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/TIT.2009.2021303 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
unreliable communication channel,constructive analog,new type,polynomial-growth-rate state space,automatic control,remote device,channel noise,automatic feedback control,real-time state estimation,error-correcting code,shannon coding theorem,space technology,feedback control,communication channels,control theory,computer science,real time,noise,mathematics,space exploration,lovasz local lemma,error correction code,channel coding,feedback,state space,base stations | Shannon coding,Constructive,Computer science,Algorithm,Communication channel,Coding (social sciences),Automatic control,Error detection and correction,Estimation theory,Lovász local lemma | Journal |
Volume | Issue | ISSN |
55 | 7 | 0018-9448 |
ISBN | Citations | PageRank |
0-7695-2468-0 | 24 | 1.22 |
References | Authors | |
18 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rafail Ostrovsky | 1 | 8743 | 588.15 |
Yuval Rabani | 2 | 2265 | 274.98 |
Leonard J. Schulman | 3 | 1328 | 136.88 |