{"title":"基于Reed-Solomon码的部分几何和LDPC码的构造","authors":"Juane Li, Keke Liu, Shu Lin, K. Abdel-Ghaffar","doi":"10.1109/ISIT.2019.8849677","DOIUrl":null,"url":null,"abstract":"This paper presents a construction of a class of partial geometries based on RS codes of prime lengths and shows that LDPC codes constructed based on Reed-Solomon codes of prime lengths are finite geometry LDPC codes. Furthermore, a new method for design and construction of nonbinary quasi-cyclic LDPC codes based on the conventional parity-check matrices of Reed-Solomon codes is presented. Simulation results show that the constructed nonbinary LDPC codes perform well over the additive white Gaussian channel.","PeriodicalId":6708,"journal":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"61-65"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Construction of Partial Geometries and LDPC codes based on Reed-Solomon Codes\",\"authors\":\"Juane Li, Keke Liu, Shu Lin, K. Abdel-Ghaffar\",\"doi\":\"10.1109/ISIT.2019.8849677\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a construction of a class of partial geometries based on RS codes of prime lengths and shows that LDPC codes constructed based on Reed-Solomon codes of prime lengths are finite geometry LDPC codes. Furthermore, a new method for design and construction of nonbinary quasi-cyclic LDPC codes based on the conventional parity-check matrices of Reed-Solomon codes is presented. Simulation results show that the constructed nonbinary LDPC codes perform well over the additive white Gaussian channel.\",\"PeriodicalId\":6708,\"journal\":{\"name\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"volume\":\"1 1\",\"pages\":\"61-65\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Symposium on Information Theory (ISIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2019.8849677\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Symposium on Information Theory (ISIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2019.8849677","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Construction of Partial Geometries and LDPC codes based on Reed-Solomon Codes
This paper presents a construction of a class of partial geometries based on RS codes of prime lengths and shows that LDPC codes constructed based on Reed-Solomon codes of prime lengths are finite geometry LDPC codes. Furthermore, a new method for design and construction of nonbinary quasi-cyclic LDPC codes based on the conventional parity-check matrices of Reed-Solomon codes is presented. Simulation results show that the constructed nonbinary LDPC codes perform well over the additive white Gaussian channel.