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 and Stopping Redundancy of Product Codes
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel
IEEE Transactions on Information Theory
On the minimum distance of array codes as LDPC codes
IEEE Transactions on Information Theory
Combinatorial constructions of low-density parity-check codes for iterative decoding
IEEE Transactions on Information Theory
Stopping set distribution of LDPC code ensembles
IEEE Transactions on Information Theory
On the stopping distance and the stopping redundancy of codes
IEEE Transactions on Information Theory
Shortened Array Codes of Large Girth
IEEE Transactions on Information Theory
Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators
IEEE Transactions on Information Theory
On the number of minimum stopping sets and minimum codewords of array LDPC codes
IEEE Communications Letters
Stopping set distributions of algebraic geometry codes from elliptic curves
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Hi-index | 754.84 |
For q an odd prime and 1 ≤ m ≤ q, we study two binary qm × q2 parity check matrices for binary array codes. For both parity check matrices, we determine the stopping distance and the minimum distance of the associated code for 2 ≤ m ≤ 3, and for (m,q) = (4,5). In the case (m,q) = (4,7), the stopping distance and the related minimum distance are also determined for one of the given parity check matrices. Moreover, we give a lower bound on the stopping distances for m 3 and q 3.