More on the Stopping and Minimum Distances of Array Codes

For q an odd prime and 1≤ m ≤ q, two specific binary qm × q 2 parity-check matrices denoted by H P (m, q) and H I (m, q) are considered. The corresponding binary codes, C P (m, q) and C I (m, q), respectively, are called proper and improper array codes with parameters m and q. Given a parity-check matrix H representing a binary code C, let s(H) denote the stopping distance of H and d(C) be the minimum Hamming distance of C. It is known that that s(H I (m, q)) = s(H P (m, q)) = d(C I (m, q)) = d(C P (m, q)) for m ≤ 3. In this paper, we show that these equalities do not hold for all values of m and q. In particular, although s(H P (4, 7)) = d(C P (4, 7)) = 8 we have s(H I (4, 7)) = 9 and d(C I (4, 7)) = 10. It is also shown that s(H P (5,1))dC P (5, 11)) = 10 while s(H I (5,11)) = 11 and d(C I (5, 11)) = 12. This suggests that in many cases the improper array codes would perform better than the proper array codes over the AWGN and binary erasure channels. Performance results are given which confirm this claim. The combinatorial structure of the eight-element stopping sets for H(m ≥ 4,q >; 5) is also determined.