{"title":"关于二进制代码未检测到的错误概率","authors":"Fang-Wei Fu, T. Kløve, V. Wei","doi":"10.1109/ISIT.2001.936017","DOIUrl":null,"url":null,"abstract":"In this paper, the undetected error probability for binary codes is studied. A new proof of Abdel-Ghaffar's (see IEEE Trans. Inform. Theory, vol.43, no.5, p.1489-1502, Sept. 1997) lower bound on the undetected error probability is presented. Further, a lower bound for the binomial moments of the distance distribution of binary constant weight codes is derived, and this yields a lower bound on the undetected error probability for binary constant weight codes. Finally, a lower bound on the undetected error probability of binary linear codes for single-error correction and detection of further errors is presented.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"56 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"On the undetected error probability for binary codes\",\"authors\":\"Fang-Wei Fu, T. Kløve, V. Wei\",\"doi\":\"10.1109/ISIT.2001.936017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the undetected error probability for binary codes is studied. A new proof of Abdel-Ghaffar's (see IEEE Trans. Inform. Theory, vol.43, no.5, p.1489-1502, Sept. 1997) lower bound on the undetected error probability is presented. Further, a lower bound for the binomial moments of the distance distribution of binary constant weight codes is derived, and this yields a lower bound on the undetected error probability for binary constant weight codes. Finally, a lower bound on the undetected error probability of binary linear codes for single-error correction and detection of further errors is presented.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"56 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"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.936017\",\"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.936017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the undetected error probability for binary codes
In this paper, the undetected error probability for binary codes is studied. A new proof of Abdel-Ghaffar's (see IEEE Trans. Inform. Theory, vol.43, no.5, p.1489-1502, Sept. 1997) lower bound on the undetected error probability is presented. Further, a lower bound for the binomial moments of the distance distribution of binary constant weight codes is derived, and this yields a lower bound on the undetected error probability for binary constant weight codes. Finally, a lower bound on the undetected error probability of binary linear codes for single-error correction and detection of further errors is presented.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
