{"title":"三次半对称图的LDPC码","authors":"D. Crnković, Sanja Rukavina, Marina Simac","doi":"10.26493/1855-3974.2501.4C4","DOIUrl":null,"url":null,"abstract":"In this paper we study LDPC codes having cubic semisymmetric graphs as their Tanner graphs. We discuss the structure of the smallest absorbing sets of these LDPC codes. Further, we give an expression for the variance of the syndrome weight of the constructed codes, and present computational and simulation results.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"19 1","pages":"2"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"LDPC codes from cubic semisymmetric graphs\",\"authors\":\"D. Crnković, Sanja Rukavina, Marina Simac\",\"doi\":\"10.26493/1855-3974.2501.4C4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we study LDPC codes having cubic semisymmetric graphs as their Tanner graphs. We discuss the structure of the smallest absorbing sets of these LDPC codes. Further, we give an expression for the variance of the syndrome weight of the constructed codes, and present computational and simulation results.\",\"PeriodicalId\":8402,\"journal\":{\"name\":\"Ars Math. Contemp.\",\"volume\":\"19 1\",\"pages\":\"2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ars Math. Contemp.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26493/1855-3974.2501.4C4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Math. Contemp.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/1855-3974.2501.4C4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we study LDPC codes having cubic semisymmetric graphs as their Tanner graphs. We discuss the structure of the smallest absorbing sets of these LDPC codes. Further, we give an expression for the variance of the syndrome weight of the constructed codes, and present computational and simulation results.