{"title":"一种基于投影平面构造LDPC码的简单方法","authors":"S. Kovalev, V. Krachkovsky","doi":"10.1109/ISIT.2011.6034231","DOIUrl":null,"url":null,"abstract":"We consider a simple description of the incidence matrix of a projective plane over the field GF(q), using multiplication and addition tables of the finite field. Some basic properties of LDPC codes derived from such incidence matrices are discussed. Further, a class of LDPC codes of paper [1], derived from Reed-Solomon (RS) codes with two information symbols, is considered. By comparing these two classes, we give a simple equivalence proof for them.","PeriodicalId":208375,"journal":{"name":"2011 IEEE International Symposium on Information Theory Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A simple method to construct LDPC codes based on projective planes\",\"authors\":\"S. Kovalev, V. Krachkovsky\",\"doi\":\"10.1109/ISIT.2011.6034231\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a simple description of the incidence matrix of a projective plane over the field GF(q), using multiplication and addition tables of the finite field. Some basic properties of LDPC codes derived from such incidence matrices are discussed. Further, a class of LDPC codes of paper [1], derived from Reed-Solomon (RS) codes with two information symbols, is considered. By comparing these two classes, we give a simple equivalence proof for them.\",\"PeriodicalId\":208375,\"journal\":{\"name\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Symposium on Information Theory Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2011.6034231\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Information Theory Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2011.6034231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A simple method to construct LDPC codes based on projective planes
We consider a simple description of the incidence matrix of a projective plane over the field GF(q), using multiplication and addition tables of the finite field. Some basic properties of LDPC codes derived from such incidence matrices are discussed. Further, a class of LDPC codes of paper [1], derived from Reed-Solomon (RS) codes with two information symbols, is considered. By comparing these two classes, we give a simple equivalence proof for them.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
