Comments on: "Erasure rate analysis and tighter upper bound for binary product codes"

Maan A. Kousa; Hazem H. Selmi

doi:10.1109/LCOMM.2007.070369

Comments on: "Erasure rate analysis and tighter upper bound for binary product codes"

Maan A. Kousa^*, Hazem H. Selmi

^*Corresponding author for this work

Research output: Contribution to journal › Comment/debate

1 Scopus citations

Abstract

The above paper, by Ali A. Al-Shaikhi and Jacek Ilow, claimed to have developed a tighter upper bound on postdecoding 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.

Original language	English
Pages (from-to)	139
Number of pages	1
Journal	IEEE Communications Letters
Volume	12
Issue number	2
DOIs	https://doi.org/10.1109/LCOMM.2007.070369
State	Published - Feb 2008

Keywords

Erasure decoding
Product codes
SPC codes

ASJC Scopus subject areas

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2007.070369

Cite this

@article{eaf79804bc584476b83f0d426aa04e97,

title = "Comments on: {"}Erasure rate analysis and tighter upper bound for binary product codes{"}",

abstract = "The above paper, by Ali A. Al-Shaikhi and Jacek Ilow, claimed to have developed a tighter upper bound on postdecoding 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 = "Erasure decoding, Product codes, SPC codes",

author = "Kousa, {Maan A.} and Selmi, {Hazem H.}",

year = "2008",

month = feb,

doi = "10.1109/LCOMM.2007.070369",

language = "English",

volume = "12",

pages = "139",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

T1 - Comments on

T2 - "Erasure rate analysis and tighter upper bound for binary product codes"

AU - Kousa, Maan A.

AU - Selmi, Hazem H.

PY - 2008/2

Y1 - 2008/2

N2 - The above paper, by Ali A. Al-Shaikhi and Jacek Ilow, claimed to have developed a tighter upper bound on postdecoding 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.

AB - The above paper, by Ali A. Al-Shaikhi and Jacek Ilow, claimed to have developed a tighter upper bound on postdecoding 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.

KW - Erasure decoding

KW - Product codes

KW - SPC codes

UR - http://www.scopus.com/inward/record.url?scp=40749137774&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2007.070369

DO - 10.1109/LCOMM.2007.070369

M3 - Comment/debate

AN - SCOPUS:40749137774

SN - 1089-7798

VL - 12

SP - 139

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 2

ER -

Comments on: "Erasure rate analysis and tighter upper bound for binary product codes"

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this