Title :
A note on the Poor-Verdu upper bound for the channel reliability function
Author :
Alajaji, Fady ; Chen, Po-Ning ; Rached, Ziad
Author_Institution :
Dept. of Math. & Stat., Queen´´s Univ., Kingston, Ont., Canada
fDate :
1/1/2002 12:00:00 AM
Abstract :
In an earlier work, Poor and Verdu (1995) established an upper bound for the reliability function of arbitrary single-user discrete-time channels with memory. They also conjectured that their bound is tight for all coding rates. We demonstrate via a counterexample involving memoryless binary erasure channels (BECs) that the Poor-Verdu upper bound is not tight at low rates. We conclude by examining possible improvements to this bound
Keywords :
block codes; channel coding; error statistics; memoryless systems; reliability; Poor-Verdu upper bound; channel block code; channel reliability function; coding rates; error probability; memory; memoryless binary erasure channels; single-user discrete-time channels; Block codes; Councils; Error probability; Genetic expression; Information theory; Mathematics; Memoryless systems; Monte Carlo methods; Statistics; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
