解码不匹配的线性分组码集成错误概率的上界

2020 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2020-10-24 DOI:10.1587/transfun.2021tap0001

T. Niinomi, H. Yagi, S. Hirasawa

{"title":"解码不匹配的线性分组码集成错误概率的上界","authors":"T. Niinomi, H. Yagi, S. Hirasawa","doi":"10.1587/transfun.2021tap0001","DOIUrl":null,"url":null,"abstract":"In this paper, applying the technique of the DS2 bound, we derive an upper bound on the error probability of mismatched decoding with the ensemble of linear block codes, which was defined by Hof, Sason and Shamai. Assuming the ensemble of random linear block codes defined by Gallager, we show that the obtained bound is not looser than the conventional bound.","PeriodicalId":347402,"journal":{"name":"2020 International Symposium on Information Theory and Its Applications (ISITA)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding\",\"authors\":\"T. Niinomi, H. Yagi, S. Hirasawa\",\"doi\":\"10.1587/transfun.2021tap0001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, applying the technique of the DS2 bound, we derive an upper bound on the error probability of mismatched decoding with the ensemble of linear block codes, which was defined by Hof, Sason and Shamai. Assuming the ensemble of random linear block codes defined by Gallager, we show that the obtained bound is not looser than the conventional bound.\",\"PeriodicalId\":347402,\"journal\":{\"name\":\"2020 International Symposium on Information Theory and Its Applications (ISITA)\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Symposium on Information Theory and Its Applications (ISITA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1587/transfun.2021tap0001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Symposium on Information Theory and Its Applications (ISITA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1587/transfun.2021tap0001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文利用DS2界的技术，推导了Hof、Sason和Shamai定义的线性分组码集成不匹配译码错误概率的上界。假设Gallager定义的随机线性分组码集合，我们证明了所得到的界并不比常规界更松散。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding

In this paper, applying the technique of the DS2 bound, we derive an upper bound on the error probability of mismatched decoding with the ensemble of linear block codes, which was defined by Hof, Sason and Shamai. Assuming the ensemble of random linear block codes defined by Gallager, we show that the obtained bound is not looser than the conventional bound.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 International Symposium on Information Theory and Its Applications (ISITA)

自引率

0.00%

发文量