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 条
  • [21] Study on the QC-LDPC code in optical communication system based on the FOPA
    Zheng, J. (dotopala@hotmail.com), 1600, Board of Optronics Lasers, No. 47 Yang-Liu-Qing Ying-Jian Road, Tian-Jin City, 300380, China (25):
  • [22] PEG-Like Design of Binary QC-LDPC Codes Based on Detecting and Avoiding Generating Small Cycles
    He, Xuan
    Zhou, Liang
    Du, Junyi
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (05) : 1845 - 1858
  • [23] A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
    Baldi, Marco
    Bodrato, Marco
    Chiaraluce, Franco
    SECURITY AND CRYPTOGRAPHY FOR NETWORKS, PROCEEDINGS, 2008, 5229 : 246 - +
  • [24] Girth Analysis of Tanner's (3,17)-Regular QC-LDPC Codes Based on Euclidean Division Algorithm
    Xu, Hengzhou
    Duan, Yake
    Miao, Xiaoxiao
    Zhu, Hai
    IEEE ACCESS, 2019, 7 : 94917 - 94930
  • [25] AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC Codes
    Bocharova, Irina E.
    Kudryashov, Boris D.
    Skachek, Vitaly
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 56 - 60
  • [26] Optimization of Bilayer Lengthened QC-LDPC code for Relay channel Based on Differential Evolution
    Xu, Hua
    2011 7TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING (WICOM), 2011,
  • [27] LEDAcrypt: QC-LDPC Code-Based Cryptosystems with Bounded Decryption Failure Rate
    Baldi, Marco
    Barenghi, Alessandro
    Chiaraluce, Franco
    Pelosi, Gerardo
    Santini, Paolo
    CODE-BASED CRYPTOGRAPHY, CBC 2019, 2019, 11666 : 11 - 43
  • [28] High Weight Code-Based Signature Scheme from QC-LDPC Codes
    Tan, Chik How
    Prabowo, Theo Fanuela
    INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2023, PT I, 2024, 14561 : 306 - 323
  • [29] A novel QC-LDPC code based on the finite field multiplicative group for optical communications
    袁建国
    许亮
    仝青振
    Optoelectronics Letters, 2013, 9 (05) : 378 - 380
  • [30] A novel QC-LDPC code based on the finite field multiplicative group for optical communications
    Yuan J.-G.
    Xu L.
    Tong Q.-Z.
    Yuan, J. (yuanjg@cqupt.edu.cn), 2013, Springer Verlag (09): : 378 - 380