On the minimum distance of array codes as LDPC codes

For a prime q and an integer j/spl les/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)/spl ges/10 for any prime q>7. 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).

[1]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[2]  Robert Michael Tanner,et al.  Minimum-distance bounds by graph analysis , 2001, IEEE Trans. Inf. Theory.

[3]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[4]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[5]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[6]  Mario Blaum,et al.  New array codes for multiple phased burst correction , 1993, IEEE Trans. Inf. Theory.

[7]  T. Mittelholzer.  Efficient encoding and minimum distance bounds of Reed-Solomon-type array codes , 2002, Proceedings IEEE International Symposium on Information Theory,.