By Topic

On the Stopping Distance of Array Code Parity-Check Matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Esmaeili, M. ; Dept. of Math. Sci., Isfahan Univ. of Technol., Isfahan, Iran ; Amoshahy, M.J.

For q an odd prime and 1 les m les q, we study two binary qm times 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 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.

Published in:

Information Theory, IEEE Transactions on  (Volume:55 ,  Issue: 8 )