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

Fady Alajaji; Po-Ning Chen; Ziad Rached

doi:10.1109/18.971761

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

Department of Electrical and Computer Engineering

Research output: Contribution to journal › Letter › peer-review

5 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 language	English
Article number	971761
Pages (from-to)	309-313
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	48
Issue number	1
DOIs	https://doi.org/10.1109/18.971761
State	Published - 1 Jan 2002

Keywords

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

Access to Document

10.1109/18.971761

Cite this

@article{0d733a50288441729bc6e77b3240bac0,

title = "A note on the Poor-Verd{\'u} upper bound for the channel reliability function",

abstract = "In an earlier work, Poor and Verd{\'u} 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{\'u} upper bound is not tight at low rates. We conclude by examining possible improvements to this bound.",

keywords = "Arbitrary channels with memory, Binary erasure channels (BECs), Channel coding, Channel reliability function, Information spectrum, Probability of error",

author = "Fady Alajaji and Po-Ning Chen and Ziad Rached",

year = "2002",

month = jan,

day = "1",

doi = "10.1109/18.971761",

language = "English",

volume = "48",

pages = "309--313",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

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

AU - Alajaji, Fady

AU - Chen, Po-Ning

AU - Rached, Ziad

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

KW - Arbitrary channels with memory

KW - Binary erasure channels (BECs)

KW - Channel coding

KW - Channel reliability function

KW - Information spectrum

KW - Probability of error

UR - http://www.scopus.com/inward/record.url?scp=0036163350&partnerID=8YFLogxK

U2 - 10.1109/18.971761

DO - 10.1109/18.971761

M3 - Letter

AN - SCOPUS:0036163350

SN - 0018-9448

VL - 48

SP - 309

EP - 313

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 1

M1 - 971761

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this