On the stopping distance of array code parity-check matrices

  • Authors:
  • Morteza Esmaeili;Mohammad Javad Amoshahy

  • Affiliations:
  • Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran;Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2009

Quantified Score

Hi-index 754.84

Visualization

Abstract

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.