用拉马努金图和马古利斯思想构造正则和不规则LDPC码

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-29 DOI:10.1109/ISIT.2001.935867

J. Rosenthal, P. Vontobel

{"title":"用拉马努金图和马古利斯思想构造正则和不规则LDPC码","authors":"J. Rosenthal, P. Vontobel","doi":"10.1109/ISIT.2001.935867","DOIUrl":null,"url":null,"abstract":"Some twenty years ago Margulis (1982) proposed an algebraic construction of low density parity check (LDPC) codes. In this paper we mimick the construction of Margulis and describe a method for algebraically constructing regular and irregular LDPC codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"157 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"48","resultStr":"{\"title\":\"Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis\",\"authors\":\"J. Rosenthal, P. Vontobel\",\"doi\":\"10.1109/ISIT.2001.935867\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Some twenty years ago Margulis (1982) proposed an algebraic construction of low density parity check (LDPC) codes. In this paper we mimick the construction of Margulis and describe a method for algebraically constructing regular and irregular LDPC codes.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"157 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"48\",\"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.935867\",\"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.935867","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 48

摘要

大约二十年前，马古利斯(1982)提出了低密度奇偶校验码的代数构造。本文模拟了马古利斯的构造，描述了一种用代数方法构造正则和不规则LDPC码的方法。

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

查看原文本刊更多论文

Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis

Some twenty years ago Margulis (1982) proposed an algebraic construction of low density parity check (LDPC) codes. In this paper we mimick the construction of Margulis and describe a method for algebraically constructing regular and irregular LDPC codes.

求助全文

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

来源期刊

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

自引率

0.00%

发文量