LDPC Codes Based on the Space of Symmetric Matrices Over Finite Fields
LDPC Codes Based on the Space of Symmetric Matrices Over Finite Fields
复制标题
基于有限域对称矩阵空间的LDPC码
DOI：
10.1109/tit.2017.2685501
复制
发表时间：
2017-07-01
影响因子：
2.5
通讯作者：
Zhao, Meng
中科院分区：
文献类型：
--
作者：
Ma, Changli;Wang, Qi;Zhao, Meng
本文提出了一种基于F-q上n × n对称矩阵空间S-n（F-q）显式构造正则低密度奇偶校验（LDPC）码的新方法。利用这种方法，我们得到了两类码长均为8的二元LDPC码C（n，q）和C-T（n，q）。然后，每类的最小距离和停止距离进行了研究。证明了C-T（n，q）的最小距离和停止距离均为2 q。对于C（n，q），我们确定了一些特殊情况下的最小距离和停止距离，并得到了其他情况下的下界。
In this paper, we present a new method for explicitly constructing regular low-density parity-check (LDPC) codes based on S-n(F-q), the space of n x n symmetric matrices over F-q. Using this method, we obtain two classes of binary LDPC codes, C(n, q) and C-T (n, q), both of which have grith 8. Then, both the minimum distance and the stopping distance of each class are investigated. It is shown that the minimum distance and the stopping distance of C-T (n, q) are both 2q. As for C(n, q), we determine the minimum distance and the stopping distance for some special cases and obtain some lower bounds for other cases.