Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis

被引：0
|
作者：
Kharin, A.V. [1 ]
Zavertkin, K.N. [1 ]
Ovinnikov, A.A. [1 ]
机构：
[1] Kharin, A.V.
[2] Zavertkin, K.N.
[3] Ovinnikov, A.A.
来源：
| 1600年 / Pleiades journals卷 / 56期
基金：
俄罗斯科学基金会;
关键词：
Graph theory;
D O I：
暂无
中图分类号：
O144 [集合论]; O157 [组合数学（组合学）];
学科分类号：
070104 ;
摘要：
We complete the description of the procedure of topological expansion of a bipartite graph without parallel branches on the plane of changing the structure of cycles of length up to 10 inclusive. Based on previous papers, we have extended a set of theorems specifying transformation rules for cycles and paths when passing from a protograph to the Tanner graph. We propose a procedure for detecting the existence of a cycle of length 10 in the expanded graph by analyzing the protograph. © 2020, Pleiades Publishing, Inc.
引用
收藏
页码：317 / 331
相关论文
共 45 条
  • [1] Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
    A. V. Kharin
    K. N. Zavertkin
    A. A. Ovinnikov
    Problems of Information Transmission, 2020, 56 : 317 - 331
  • [2] Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
    Kharin, A. V.
    Zavertkin, K. N.
    Ovinnikov, A. A.
    PROBLEMS OF INFORMATION TRANSMISSION, 2020, 56 (04) : 317 - 331
  • [3] Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
    A. V. Kharin
    K. N. Zavertkin
    A. A. Ovinnikov
    Problems of Information Transmission, 2020, 56 : 173 - 184
  • [4] Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
    Kharin, A., V
    Zavertkin, K. N.
    Ovinnikov, A. A.
    PROBLEMS OF INFORMATION TRANSMISSION, 2020, 56 (02) : 173 - 184
  • [5] Ruling out small stopping sets and small girth in Tanner graph of QC-LDPC code
    Lingjun Kong and Yang Xiao Institute of Information Science
    Journal of Systems Engineering and Electronics, 2010, 21 (01) : 134 - 137
  • [6] Ruling out small stopping sets and small girth in Tanner graph of QC-LDPC code
    Kong, Lingjun
    Xiao, Yang
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2010, 21 (01) : 134 - 137
  • [7] A Novel Construction Method of QC-LDPC Based on BIBD and Protograph
    Huang, Sheng
    Zhang, Rui
    Jia, Xueting
    Ao, Xiang
    Yuan, Jianguo
    PROCEEDINGS OF THE 2017 5TH INTERNATIONAL CONFERENCE ON FRONTIERS OF MANUFACTURING SCIENCE AND MEASURING TECHNOLOGY (FMSMT 2017), 2017, 130 : 1125 - 1131
  • [8] Counting short cycles of QC-LDPC codes in base graph
    Wang, Liqian
    Zou, Jingke
    Zhu, Miao
    Zhao, Yatong
    ELECTRONICS LETTERS, 2024, 60 (02)
  • [9] Performance Analysis of QC-LDPC Construction Based on Distance Graph
    Li, Lixin
    Zhu, Meng
    Yang, Fan
    Zhang, Yang
    PROCEEDINGS OF THE 2013 IEEE 8TH CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA), 2013, : 1162 - 1166
  • [10] Some variations of Tanner's construction for short length QC-LDPC codes
    Kim, Wonjun
    Cho, Hyunwoo
    Song, Hong-Yeop
    Song, Min Kyu
    ELECTRONICS LETTERS, 2024, 60 (03)
12345