A note on the Poor-Verdu upper bound for the channel reliability function
檔案
- 000172727300026.pdf (389.9 KB, Adobe PDF)
日期
2002-01-01
系所
期刊名稱
IEEE TRANSACTIONS ON INFORMATION THEORY
卷期與頁次
第 48 卷第 1 期,頁 309–313
ISSN
0018-9448
語言
英文
摘要
In an earlier work, Poor and Verdu 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-Verdu upper bound is not tight at low rates. We conclude by examining possible improvements to this bound.
關鍵詞
arbitrary channels with memorybinary erasure channels (BECs)channel codingchannel reliability functioninformation spectrumprobability of error所屬典藏
會議論文引用此條目
Alajaji, F., Chen, P., & Rached, Z. (2002). A note on the Poor-Verdu upper bound for the channel reliability function. IEEE TRANSACTIONS ON INFORMATION THEORY, 48(1), 309–313. https://doi.org/10.1109/18.971761
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/29086