Extremes of error exponents
This paper determines the range of feasible values of standard error exponents for binary-input memoryless symmetric channels of fixed capacity C and shows that extremes are attained by the binary symmetric and the binary erasure channel. The proof technique also provides analogous extremes for othe...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2013 |
| País: | España |
| Institución: | Universitat Pompeu Fabra |
| Repositorio: | Repositorio Digital de la UPF |
| OAI Identifier: | oai:repositori.upf.edu:10230/36018 |
| Acceso en línea: | http://hdl.handle.net/10230/36018 http://dx.doi.org/10.1109/TIT.2012.2233271 |
| Access Level: | acceso abierto |
| Palabra clave: | Bhattacharyya parameter Channel capacity Channel dispersion Cutoff rate Discrete memoryless channels Error exponents Error probability Random coding Symmetric channels |
| Sumario: | This paper determines the range of feasible values of standard error exponents for binary-input memoryless symmetric channels of fixed capacity C and shows that extremes are attained by the binary symmetric and the binary erasure channel. The proof technique also provides analogous extremes for other quantities related to Gallager's E 0 function, such as the cutoff rate, the Bhattacharyya parameter, and the channel dispersion. |
|---|