Sign in

Bounds on the reliability of typewriter channels

By M. Dalai and Y. Polyanskiy
New lower and upper bounds on the reliability function of typewriter channels are given. Our lower bounds improve upon the (multiletter) expurgated bound of Gallager, furnishing a new and simple counterexample to a conjecture made in 1967 by Shannon, Gallager and Berlekamp on its tightness. The only other known counterexample... Show more
October 31, 2017
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
Bounds on the reliability of typewriter channels
Click on play to start listening