{"title":"基于Sidon序列的周长至少为8的拟循环LDPC码","authors":"Guohua Zhang, Rong Sun, Xinmei Wang","doi":"10.1109/ISTC.2012.6325193","DOIUrl":null,"url":null,"abstract":"A new family of quasi-cyclic low-density parity-check (LDPC) codes of girth at least eight is explicitly constructed from Sidon sequences. These codes can be encoded using simple shift-registers. Furthermore, for short to moderate lengths these quasi-cyclic codes perform close to random progressive edge-growth (PEG) LDPC codes in terms of bit-error probability and block-error probability, collectively.","PeriodicalId":197982,"journal":{"name":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"New quasi-cyclic LDPC codes with girth at least eight based on Sidon sequences\",\"authors\":\"Guohua Zhang, Rong Sun, Xinmei Wang\",\"doi\":\"10.1109/ISTC.2012.6325193\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new family of quasi-cyclic low-density parity-check (LDPC) codes of girth at least eight is explicitly constructed from Sidon sequences. These codes can be encoded using simple shift-registers. Furthermore, for short to moderate lengths these quasi-cyclic codes perform close to random progressive edge-growth (PEG) LDPC codes in terms of bit-error probability and block-error probability, collectively.\",\"PeriodicalId\":197982,\"journal\":{\"name\":\"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTC.2012.6325193\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTC.2012.6325193","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New quasi-cyclic LDPC codes with girth at least eight based on Sidon sequences
A new family of quasi-cyclic low-density parity-check (LDPC) codes of girth at least eight is explicitly constructed from Sidon sequences. These codes can be encoded using simple shift-registers. Furthermore, for short to moderate lengths these quasi-cyclic codes perform close to random progressive edge-growth (PEG) LDPC codes in terms of bit-error probability and block-error probability, collectively.