On the Minimum Weight of Simple Full-Length Array LDPC Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the stopping distance of array code parity-check matrices
IEEE Transactions on Information Theory
On the number of minimum weight codewords of SFA-LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
A lattice-based systematic recursive construction of quasi-cyclic LDPC codes
IEEE Transactions on Communications
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes
IEEE Transactions on Information Theory
On the number of minimum stopping sets and minimum codewords of array LDPC codes
IEEE Communications Letters
| Hi-index | 754.96 |
For a prime q and an integer j≤q, the code C(q,j) is a class of low-density parity-check (LDPC) codes from array codes which has a nice algebraic structure. In this correspondence, we investigate the minimum distance d(q,j) of the code in an algebraic way. We first prove that the code is invariant under a doubly transitive group of "affine" permutations. Then, we show that d(5,4)=8, d(7,4)=8, and d(q,4)≥10 for any prime q7. In addition, we also analyze the codewords of weight 6 in the case of j=3 and the codewords of weight 8 in C(5,4) and C(7,4).