构造有效可编码的不规则LDPC码的代数方法

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. Pub Date : 2005-10-31 DOI:10.1109/ISIT.2005.1523458

Hachiro Fujita, Maki Ohata, K. Sakaniwa

{"title":"构造有效可编码的不规则LDPC码的代数方法","authors":"Hachiro Fujita, Maki Ohata, K. Sakaniwa","doi":"10.1109/ISIT.2005.1523458","DOIUrl":null,"url":null,"abstract":"In this paper we propose an algebraic construction of efficiently encodable irregular LDPC codes. The proposed irregular LDPC codes have not only an efficient encoding algorithm but also guaranteed minimum distances. Simulation results show that the proposed codes perform well compared to randomly constructed irregular LDPC codes","PeriodicalId":166130,"journal":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An algebraic method for constructing efficiently encodable irregular LDPC codes\",\"authors\":\"Hachiro Fujita, Maki Ohata, K. Sakaniwa\",\"doi\":\"10.1109/ISIT.2005.1523458\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose an algebraic construction of efficiently encodable irregular LDPC codes. The proposed irregular LDPC codes have not only an efficient encoding algorithm but also guaranteed minimum distances. Simulation results show that the proposed codes perform well compared to randomly constructed irregular LDPC codes\",\"PeriodicalId\":166130,\"journal\":{\"name\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2005.1523458\",\"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. International Symposium on Information Theory, 2005. ISIT 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2005.1523458","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

本文提出了一种高效可编码的不规则LDPC码的代数构造。提出的不规则LDPC码不仅具有高效的编码算法，而且保证了最小距离。仿真结果表明，与随机构造的不规则LDPC码相比，所提出的码具有良好的性能

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

查看原文本刊更多论文

An algebraic method for constructing efficiently encodable irregular LDPC codes

In this paper we propose an algebraic construction of efficiently encodable irregular LDPC codes. The proposed irregular LDPC codes have not only an efficient encoding algorithm but also guaranteed minimum distances. Simulation results show that the proposed codes perform well compared to randomly constructed irregular LDPC codes

求助全文

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

来源期刊

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

自引率

0.00%

发文量