DocumentCode
3275679
Title
On the Poor-Verdu conjecture for the reliability function of channels with memory
Author
Alajaji, Fady ; Chen, Po-Ning ; Rached, Ziad
Author_Institution
Dept. of Math. & Stat., Queen´´s Univ., Kingston, Ont., Canada
fYear
2001
fDate
2001
Firstpage
124
Abstract
In a previous work, Poor and Verdu (1995) established an upper bound to the reliability function of arbitrary single-user discrete-time channels with memory. They also conjectured that their bound is tight for all coding rates. In this work, we demonstrate via a counterexample involving memoryless binary erasure channels that the Poor-Verdu upper bound is, unfortunately, not tight at low rates. We also examine possible improvements to this bound
Keywords
discrete time systems; memoryless systems; reliability; telecommunication channels; Poor-Verdu conjecture; Poor-Verdu upper bound; coding rates; memory channels; memoryless binary erasure channels; reliability function; single-user discrete-time channels; upper bound; Error probability; Information theory; Mathematics; Reliability theory; Statistics; Testing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location
Washington, DC
Print_ISBN
0-7803-7123-2
Type
conf
DOI
10.1109/ISIT.2001.935987
Filename
935987
Link To Document