Title :
Comments on: "Erasure rate analysis and tighter upper bound for binary product codes"
Author :
Kousa, Maan A. ; Selmi, Hazem H.
Author_Institution :
King Fahd Univ. of Pet. & Miner., Dhahran
fDate :
2/1/2008 12:00:00 AM
Abstract :
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.
Keywords :
binary codes; decoding; binary product codes; post-decoding erasure rate; Counting circuits; Decoding; Difference equations; Helium; Inspection; Pattern recognition; Petroleum; Product codes; Shape; Upper bound;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2007.070369