Bounds on the reliability of a typewriter channel

Author(s)
Dalai, Marco; Polyanskiy, Yury
Thumbnail
DownloadPolyanskiy_Bounds on the.pdf (333.3Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability 1/2. The lower bound is more of theoretical than practical importance; it improves very marginally the expurgated bound, providing a counterexample to a conjecture on its tightness by Shannon, Gallager and Berlekamp which does not need the construction of algebraic-geometric codes previously used by Katsman, Tsfasman and Vlăduţ. The upper bound is derived by using an adaptation of the linear programming bound and it is essentially useful as a low-rate anchor for the straight line bound.
Date issued
2016-07
URI
http://hdl.handle.net/1721.1/113420
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
2016 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Dalai, Marco, and Yury Polyanskiy. “Bounds on the Reliability of a Typewriter Channel.” 2016 IEEE International Symposium on Information Theory (ISIT), 10-15 July, 2016, Barcelona, Spain, IEEE, 2016.
Version: Author's final manuscript
ISBN
978-1-5090-1806-2
Collections