基于原生图分析的QC-LDPC码Tanner图中长度为8的周期检测

{"title":"基于原生图分析的QC-LDPC码Tanner图中长度为8的周期检测","authors":"A. Kharin, K. Zavertkin, A. Ovinnikov","doi":"10.1134/S0032946020020039","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"56 1","pages":"173 - 184"},"PeriodicalIF":0.5000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1134/S0032946020020039","citationCount":"2","resultStr":"{\"title\":\"Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis\",\"authors\":\"A. Kharin, K. Zavertkin, A. Ovinnikov\",\"doi\":\"10.1134/S0032946020020039\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":54581,\"journal\":{\"name\":\"Problems of Information Transmission\",\"volume\":\"56 1\",\"pages\":\"173 - 184\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1134/S0032946020020039\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Problems of Information Transmission\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1134/S0032946020020039\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Problems of Information Transmission","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/S0032946020020039","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}