摘要
In a previous work, Poor and Verdú established 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 demonstrate via a counterexample involving memoryless binary erasure channels that the Poor-Vendú upper bound is, unfortunately, not tight at low rates. We also examine possible improvements to this bound.
原文 | American English |
---|---|
頁(從 - 到) | 124 |
頁數 | 1 |
期刊 | IEEE International Symposium on Information Theory - Proceedings |
DOIs | |
出版狀態 | Published - 2001 |
事件 | 2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, 美國 持續時間: 24 6月 2001 → 29 6月 2001 |