Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
ISIT2001, Washington, DC, June 24{29, 2001 On the Poor-Verd u Conjecture for the Reliability
 

Summary: ISIT2001, Washington, DC, June 24{29, 2001
On the Poor-Verdu Conjecture for the Reliability
Function of Channels with Memory
Fady Alajaji y , Po-Ning Chen ? and Ziad Rached y
y Department of Mathematics and Statistics
Queen's University, Kingston, Ontario K7L 3N6, Canada
? Department of Communication Engineering
National Chiao Tung University, Hsin Chu, Taiwan 30050
Abstract | In a previous work, Poor and Verdu es-
tablished 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 demon-
strate via a counterexample involving memoryless bi-
nary erasure channels that the Poor-Verdu upper
bound is, unfortunately, not tight at low rates. We
also examine possible improvements to this bound.
I. Introduction
Consider an arbitrary input process X de ned by a sequence
of nite-dimensional distributions [4] X 4

  

Source: Alajaji, Fady - Department of Mathematics and Statistics, Queen's University (Kingston)
Linder, Tamás - Department of Mathematics and Statistics, Queen's University (Kingston)

 

Collections: Engineering