TY - JOUR
T1 - The burst error correcting capabilities of a simple array code
AU - Raphaeli, Dan
PY - 2005/2
Y1 - 2005/2
N2 - We propose a simple decoder for a widely used array code, known as the EVENODD code, which is originally designed to correct phased burst errors, to make it useful for correcting nonphased errors. The proposed scheme is capable of correcting almost all bursts up to a certain length. We show that the failure rate is sufficiently small and approaches zero as the block length increases. The redundancy of the code is twice the maximal burst length, which is a lower bound for the redundancy of a true burst-error-correcting code. Both the encoder and the decoder have very low complexity, both in terms of number of operations and in terms of computer code size.
AB - We propose a simple decoder for a widely used array code, known as the EVENODD code, which is originally designed to correct phased burst errors, to make it useful for correcting nonphased errors. The proposed scheme is capable of correcting almost all bursts up to a certain length. We show that the failure rate is sufficiently small and approaches zero as the block length increases. The redundancy of the code is twice the maximal burst length, which is a lower bound for the redundancy of a true burst-error-correcting code. Both the encoder and the decoder have very low complexity, both in terms of number of operations and in terms of computer code size.
KW - Burst-error-correcting codes
KW - Decoding algorithms
KW - Error-correcting codes
UR - http://www.scopus.com/inward/record.url?scp=13444257792&partnerID=8YFLogxK
U2 - 10.1109/TIT.2004.840890
DO - 10.1109/TIT.2004.840890
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:13444257792
VL - 51
SP - 722
EP - 728
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
SN - 0018-9448
IS - 2
ER -