On the Stopping Distance of Array Code Parity-Check Matrices
Morteza Esmaeili, Mohammad Javad Amoshahy · IEEE Transactions on Information Theory · 2009
For q an odd prime and 1 les m les q, we study two binary qm times q2parity 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 les m les 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.