On regular quasicyclic LDPC codes from binomials
On regular quasicyclic LDPC codes from binomials
复制标题
DOI：
10.1109/isit.2004.1365314
复制
发表时间：
2004-06
期刊：
影响因子：
--
通讯作者：
R. Smarandache;P. Vontobel
中科院分区：
文献类型：
--
作者：
R. Smarandache;P. Vontobel
在过去，一些作者考虑了准循环LDPC码，其校验矩阵中的循环矩阵是循环移位的单位矩阵。通过不仅用这样的矩阵，而且用两个循环移位的单位矩阵的和和零矩阵组成奇偶校验矩阵，可以在保持相同的正则性的同时增加最小距离。具体地，对于第一类中的（3，4）正则码，最佳最小距离是24，而第二类中的最佳最小距离是32。我们给出了实现这些界限的代码的例子。
In the past, several authors have considered quasicyclic LDPC codes whose circulant matrices in the parity-check matrix are cyclically shifted identity matrices. By composing a parity-check matrix not only with such matrices but also with sums of two cyclically shifted identity matrices and with zero matrices, one can increase the minimum distance while keeping the same regularity. Specifically, whereas for (3, 4)-regular codes in the first class the best minimum distance is 24, the best minimum distance in the second class is 32. We give examples of codes that achieve these bounds.