Bounds on the reliability of a typewriter channel
Author(s)Dalai, Marco; Polyanskiy, Yury
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2016 IEEE International Symposium on Information Theory (ISIT)
Institute of Electrical and Electronics Engineers (IEEE)
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.
Author's final manuscript