A note on the Poor-Verdu upper bound for the channel reliability function
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
313 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
309 | en_US |
dc.citation.volume |
48 | en_US |
dc.contributor.author |
Alajaji, F | en_US |
dc.contributor.author |
Chen, PN | en_US |
dc.contributor.author |
Rached, Z | en_US |
dc.contributor.department |
電信工程研究所 | zh_TW |
dc.contributor.department |
Institute of Communications Engineering | en_US |
dc.date.accessioned |
2014-12-08T15:42:55Z | |
dc.date.available |
2014-12-08T15:42:55Z | |
dc.date.issued |
2002-01-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1109/18.971761 | en_US |
dc.identifier.issn |
0018-9448 | en_US |
dc.identifier.journal |
IEEE TRANSACTIONS ON INFORMATION THEORY | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/18.971761 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/29086 | |
dc.identifier.wosnumber |
WOS:000172727300026 | |
dc.language.iso |
en_US | en_US |
dc.subject |
arbitrary channels with memory | en_US |
dc.subject |
binary erasure channels (BECs) | en_US |
dc.subject |
channel coding | en_US |
dc.subject |
channel reliability function | en_US |
dc.subject |
information spectrum | en_US |
dc.subject |
probability of error | en_US |
dc.title |
A note on the Poor-Verdu upper bound for the channel reliability function | en_US |
dc.type |
Article; Proceedings Paper | en_US |
檔案
- 000172727300026.pdf (389.9 KB, Adobe PDF)
所屬典藏: 會議論文
引用此條目
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