Title: Comments on: "Erasure rate analysis and tighter upper bound for binary product codes"
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.
Publication Year: 2008
Publication Date: 2008-02-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot