Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

On the minimum distance of array codes as LDPC codes

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)
Kyeongcheol Yang ; Dept. of Electron. & Electr. Eng., Pohang Univ. of Sci. & Technol., Kyungbuk, South Korea ; Helleseth, T.

For a prime q and an integer j≤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)≥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).

Published in:

Information Theory, IEEE Transactions on  (Volume:49 ,  Issue: 12 )