2011•Unpublished venueRequires access
Extremes of random coding error exponents
Albert Guillén i Fàbregas, Ingmar Land, Alfonso García Martínez
Open publisher page 8 citations
Abstract
We show that Gallager's random coding error exponent of an arbitrary binary-input memoryless symmetric channel is upper-bounded by that of the binary erasure channel and lower-bounded by that of the binary-symmetric channel of the same capacity. We apply the result to find the extremes of the channel dispersion for the aforementioned class of channels.