{"title":"有界角最大似然不完全译码分组码的错误概率界","authors":"S. Dolinar, K. Andrews, F. Pollara, D. Divsalar","doi":"10.1109/ISITA.2008.4895487","DOIUrl":null,"url":null,"abstract":"Recently, Dolinar et al. obtained extremely tight bounds on the probabilities of decoding error and undetected error for block codes using bounded-angle maximum-likelihood (BA-ML) incomplete decoding. Unfortunately, these bounds are complex and difficult to compute for large block sizes. In this paper we obtain simple exponential upper bounds on both the word error probability and the undetected error probability of block codes using BA-ML decoding.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Bounds on error probability of block codes with bounded-angle maximum-likelihood incomplete decoding\",\"authors\":\"S. Dolinar, K. Andrews, F. Pollara, D. Divsalar\",\"doi\":\"10.1109/ISITA.2008.4895487\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, Dolinar et al. obtained extremely tight bounds on the probabilities of decoding error and undetected error for block codes using bounded-angle maximum-likelihood (BA-ML) incomplete decoding. Unfortunately, these bounds are complex and difficult to compute for large block sizes. In this paper we obtain simple exponential upper bounds on both the word error probability and the undetected error probability of block codes using BA-ML decoding.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895487\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895487","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bounds on error probability of block codes with bounded-angle maximum-likelihood incomplete decoding
Recently, Dolinar et al. obtained extremely tight bounds on the probabilities of decoding error and undetected error for block codes using bounded-angle maximum-likelihood (BA-ML) incomplete decoding. Unfortunately, these bounds are complex and difficult to compute for large block sizes. In this paper we obtain simple exponential upper bounds on both the word error probability and the undetected error probability of block codes using BA-ML decoding.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
