{"title":"一类有限几何低密度奇偶校验码","authors":"Shu Lin, Heng Tang, Y. Kou","doi":"10.1109/ISIT.2001.935865","DOIUrl":null,"url":null,"abstract":"A new class of geometry LDPC codes is presented which contains the class of Kou-Lin-Fossorier codes (see IEEE International Symposium on Information Theory, p.200, June 2000) as a subclass. If the code construction is based on Euclidean geometry (EG) and projective geometry (PG) over finite fields, we obtain four classes of LDPC codes, namely: (1) type-I EG-LDPC codes; (2) type-II EG-LDPC codes; (3) type-I PG-LDPC codes; and (4) type-II PG-LDPC codes.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"On a class of finite geometry low density parity check codes\",\"authors\":\"Shu Lin, Heng Tang, Y. Kou\",\"doi\":\"10.1109/ISIT.2001.935865\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new class of geometry LDPC codes is presented which contains the class of Kou-Lin-Fossorier codes (see IEEE International Symposium on Information Theory, p.200, June 2000) as a subclass. If the code construction is based on Euclidean geometry (EG) and projective geometry (PG) over finite fields, we obtain four classes of LDPC codes, namely: (1) type-I EG-LDPC codes; (2) type-II EG-LDPC codes; (3) type-I PG-LDPC codes; and (4) type-II PG-LDPC codes.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"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.935865\",\"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.935865","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On a class of finite geometry low density parity check codes
A new class of geometry LDPC codes is presented which contains the class of Kou-Lin-Fossorier codes (see IEEE International Symposium on Information Theory, p.200, June 2000) as a subclass. If the code construction is based on Euclidean geometry (EG) and projective geometry (PG) over finite fields, we obtain four classes of LDPC codes, namely: (1) type-I EG-LDPC codes; (2) type-II EG-LDPC codes; (3) type-I PG-LDPC codes; and (4) type-II PG-LDPC codes.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
