{"title":"带存储器信道可靠性函数的穷verdu猜想","authors":"F. Alajaji, Po-Ning Chen, Z. Rached","doi":"10.1109/ISIT.2001.935987","DOIUrl":null,"url":null,"abstract":"In a previous work, Poor and Verdu (1995) 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-Verdu upper bound is, unfortunately, not tight at low rates. We also examine possible improvements to this bound.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Poor-Verdu conjecture for the reliability function of channels with memory\",\"authors\":\"F. Alajaji, Po-Ning Chen, Z. Rached\",\"doi\":\"10.1109/ISIT.2001.935987\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a previous work, Poor and Verdu (1995) 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-Verdu upper bound is, unfortunately, not tight at low rates. We also examine possible improvements to this bound.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.935987\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.935987","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Poor-Verdu conjecture for the reliability function of channels with memory
In a previous work, Poor and Verdu (1995) 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-Verdu upper bound is, unfortunately, not tight at low rates. We also examine possible improvements to this bound.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
