{"title":"基于格的低密度奇偶校验码的改进构造","authors":"Xiongfei Tao, Jong-man Kim, Weizhong Liu, Li Kong","doi":"10.1109/ISITC.2007.55","DOIUrl":null,"url":null,"abstract":"In this paper we construct a class of LDPC codes with girth 10 based on 2-D lattices. The parity check matrix is an incident matrix of lines and points in the lattices. By selection of slope sets, general triangles and quadrangles are removed in the lattices which leads to the corresponding codes have girth no less than 10. The codes are regular, whose column weight is 3. The generated check matrix have quasi-cyclic structure, and the codes show excellent bit error rate(BER) performance over A WGN channels.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Improved Construction of Low-Density Parity-Check Codes Based on Lattices\",\"authors\":\"Xiongfei Tao, Jong-man Kim, Weizhong Liu, Li Kong\",\"doi\":\"10.1109/ISITC.2007.55\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we construct a class of LDPC codes with girth 10 based on 2-D lattices. The parity check matrix is an incident matrix of lines and points in the lattices. By selection of slope sets, general triangles and quadrangles are removed in the lattices which leads to the corresponding codes have girth no less than 10. The codes are regular, whose column weight is 3. The generated check matrix have quasi-cyclic structure, and the codes show excellent bit error rate(BER) performance over A WGN channels.\",\"PeriodicalId\":394071,\"journal\":{\"name\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITC.2007.55\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITC.2007.55","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improved Construction of Low-Density Parity-Check Codes Based on Lattices
In this paper we construct a class of LDPC codes with girth 10 based on 2-D lattices. The parity check matrix is an incident matrix of lines and points in the lattices. By selection of slope sets, general triangles and quadrangles are removed in the lattices which leads to the corresponding codes have girth no less than 10. The codes are regular, whose column weight is 3. The generated check matrix have quasi-cyclic structure, and the codes show excellent bit error rate(BER) performance over A WGN channels.