A note on the Poor-Verdú upper bound for the channel reliability function

Fady Alajaji*, Po-Ning Chen, Ziad Rached

*Corresponding author for this work

Research output: Contribution to journalLetterpeer-review

4 Scopus citations

Abstract

In an earlier work, Poor and Verdú 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. In this note, we demonstrate via a counterexample involving memoryless binary erasure channels (BECs) that the Poor-Verdú upper bound is not tight at low rates. We conclude by examining possible improvements to this bound.

Original languageEnglish
Pages (from-to)309-313
Number of pages5
JournalIEEE Transactions on Information Theory
Volume48
Issue number1
DOIs
StatePublished - 1 Jan 2002

Keywords

  • Arbitrary channels with memory
  • Binary erasure channels (BECs)
  • Channel coding
  • Channel reliability function
  • Information spectrum
  • Probability of error

Fingerprint Dive into the research topics of 'A note on the Poor-Verdú upper bound for the channel reliability function'. Together they form a unique fingerprint.

Cite this