Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Comments on: "Erasure rate analysis and tighter upper bound for binary product 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)
Kousa, M.A. ; King Fahd Univ. of Pet. & Miner., Dhahran ; Selmi, H.H.

The above paper, by AH A. Al-Shaikhi and Jacek Ilow, claimed to have developed a tighter upper bound on post- decoding erasure rate for binary product codes by deriving the exact number of unrecoverable erasure patterns over some range of the number of erasures. We show that (Equations 9 -12) are inaccurate, and hence the resultant tighter upper bound is questionable.

Published in:

Communications Letters, IEEE  (Volume:12 ,  Issue: 2 )