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

Comment on "Quasi-Cyclic Low Density Parity Check Codes From Circulant Permutation 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)
Hagiwara, M. ; Res. Center for Inf. Security, Nat. Inst. of Adv. Ind. Sci. & Technol., Tokyo ; Fossorier, M.

While preparing [H. Hagiwara et al., 2006], we realized that the proof of [M. Fossorier, 2004, Theorem 2.3] was leading to confusion as written. More precisely, only e<sub>1</sub> = o<sub>2</sub> directly follows from o<sub>1</sub> + e<sub>1</sub> and o<sub>2</sub> + e<sub>2</sub> = e. The other equality o<sub>1</sub> = e<sub>2</sub> follows from e<sub>1</sub> = e<sub>2</sub> and the fact that the sum of the (distinct) Delta's between the two rows considered has to be zero. Actually, a much concise proof can be obtained by directly observing that for J = p = 2m, {Delta<sub>1,2</sub> (I) mod p, 0 < I < L - 1} = {0,1,..., L - 1} from [M. Fossorier, 2004, Theorem 2.1], so that Sigma<sub>I=0</sub><sup>L-1</sup> Delta<sub>1,2</sub> (I) = m mod p ne 0. Since Ruwei Chen recently pointed out this issue, we decided to clarify this point.

Published in:

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