On the stopping distance of array code parity-check matrices
M Esmaeili, MJ Amoshahy - IEEE Transactions on Information …, 2009 - ieeexplore.ieee.org
M Esmaeili, MJ Amoshahy
IEEE Transactions on Information Theory, 2009•ieeexplore.ieee.orgFor q an odd prime and 1 les m les q, we study two binary qm times q 2 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.
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.
For q an odd prime and 1 les m les q, we study two binary qm times q 2 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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果