On the Second Separating Redundancy of LDPC Codes from Finite Planes

被引:5
|
作者
Liu, Haiyang [1 ]
Li, Yan [2 ]
Ma, Lianrong [3 ]
机构
[1] Chinese Acad Sci, Inst Microelect, Beijing 100029, Peoples R China
[2] China Agr Univ, Dept Appl Math, Beijing 100083, Peoples R China
[3] Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
separating redundancy; separating matrix; low-density parity-check (LDPC) codes; finite plane; GEOMETRIES;
D O I
10.1587/transfun.E101.A.617
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The separating redundancy is an important concept in the analysis of the error-and-erasure decoding of a linear block code using a parity-check matrix of the code. In this letter, we derive new constructive upper bounds on the second separating redundancies of low-density paritycheck (LDPC) codes constructed from projective and Euclidean planes over the field F-q with q even.
引用
收藏
页码:617 / 622
页数:6
相关论文
共 50 条
  • [1] On the First Separating Redundancy of Array LDPC Codes∗
    Liu, Haiyang
    Ma, Lianrong
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2024, E107A (04) : 670 - 674
  • [2] On the Smallest Absorbing Sets of LDPC Codes From Finite Planes
    Liu, Haiyang
    Li, Yan
    Ma, Lianrong
    Chen, Jie
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) : 4014 - 4020
  • [3] On the stopping distance and stopping redundancy of Finite Geometry LDPC codes
    Liu, Hai-yang
    Lin, Xiao-yan
    Ma, Lian-rong
    Chen, Jie
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (08): : 2159 - 2166
  • [4] On the Separating Redundancy of Extended Hamming Codes
    Liu, Haiyang
    Kim, Daeyeoul
    Li, Yan
    Jia, Aaron Z.
    2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2406 - 2410
  • [5] On the Separating Redundancy of Ternary Golay Codes
    Liu, Haiyang
    Ma, Lianrong
    Zhang, Hao
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2021, E104A (03) : 650 - 655
  • [6] Separating Redundancy of Linear MDS Codes
    Abdel-Ghaffar, Khaled A. S.
    Weber, Jos H.
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 1894 - +
  • [7] On the Probabilistic Computation of the Stopping Redundancy of LDPC Codes
    Hirotomo, Masanori
    Konishi, Yoshiho
    Morii, Masakatu
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 234 - 238
  • [8] Bounds on Separating Redundancy of Linear Codes and Rates of X-Codes
    Tsunoda, Yu
    Fujiwara, Yuichiro
    Ando, Hana
    Vandendriessche, Peter
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (12) : 7577 - 7593
  • [9] Partial permutation decoding for codes from finite planes
    Key, JD
    McDonough, TP
    Mavron, VC
    EUROPEAN JOURNAL OF COMBINATORICS, 2005, 26 (05) : 665 - 682
  • [10] An Upper Bound on the Separating Redundancy of Linear Block Codes
    Abdel-Ghaffar, Khaled A. S.
    Weber, Jos H.
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1173 - 1177