Published July 2019
| public
Book Section - Chapter
Real-time Binary Posterior Matching
Abstract
We consider the problem of communications over the binary symmetric channel with feedback, where the information sequence is made available in a causal, possibly random, fashion. We develop a real-time variant of the renowned Horstein scheme and provide analytical guarantees for its error-probability exponential decay rate. We further use the scheme to stabilize an unstable control plant over a binary symmetric channel and compare the analytical guarantees with its empirical performance as well as with those of anytime-reliable codes.
Additional Information
© 2019 IEEE. The work of A. Lalitha and T. Javidi was supported in part by the National Science Foundation (NSF) under Grant CIF-1719133, CIF-1513883 and CIF 1448237. This work has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 708932. The work of V. Kostina was supported in part by the NSF under Grant CCF-1566567 and Grant CCF-1751356. This work was done in part while A. Khina and V. Kostina were visiting the Simons Institute for the Theory of Computing.Additional details
- Eprint ID
- 99080
- Resolver ID
- CaltechAUTHORS:20191004-100333333
- CCF-1719133
- NSF
- CCF-1513883
- NSF
- CCF-1448237
- NSF
- 708932
- Marie Curie Fellowship
- CCF-1566567
- NSF
- CCF-1751356
- NSF
- Created
-
2019-10-04Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field