{"title":"最大似然译码下详细表示的不规则LDPC码集的分组错误概率","authors":"Ryoji Ikegaya, K. Kasai, T. Shibuya, K. Sakaniwa","doi":"10.1109/ITW.2006.1633837","DOIUrl":null,"url":null,"abstract":"In this paper, we have derived the upper bound of the average block error probability of a given detailedly represented irregular low-density parity-check (LDPC) code ensemble under maximum likelihood decoding.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Block Error Probability of Detailedly Represented Irregular LDPC Code Ensembles under Maximum Likelihood Decoding\",\"authors\":\"Ryoji Ikegaya, K. Kasai, T. Shibuya, K. Sakaniwa\",\"doi\":\"10.1109/ITW.2006.1633837\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we have derived the upper bound of the average block error probability of a given detailedly represented irregular low-density parity-check (LDPC) code ensemble under maximum likelihood decoding.\",\"PeriodicalId\":293144,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2006.1633837\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2006.1633837","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Block Error Probability of Detailedly Represented Irregular LDPC Code Ensembles under Maximum Likelihood Decoding
In this paper, we have derived the upper bound of the average block error probability of a given detailedly represented irregular low-density parity-check (LDPC) code ensemble under maximum likelihood decoding.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
