Bounds on the reliability of a typewriter channel
Name
Polyanskiy_Bounds on the.pdf
Size
333.4 KB
Format
Adobe PDF
Checksum (MD5)
61da9898687ae70dce94bdb3f2e2d25b
Author(s)
Dalai, Marco
Polyanskiy, Yury
Date Issued
July 2016
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2016.7541592
