CODES CORRECTING PHASED BURST ERASURES

Authors
Citation
O. Keren et S. Litsyn, CODES CORRECTING PHASED BURST ERASURES, IEEE transactions on information theory, 44(1), 1998, pp. 416-420
Citations number
18
Categorie Soggetti
Computer Science Information Systems","Engineering, Eletrical & Electronic","Computer Science Information Systems
ISSN journal
00189448
Volume
44
Issue
1
Year of publication
1998
Pages
416 - 420
Database
ISI
SICI code
0018-9448(1998)44:1<416:CCPBE>2.0.ZU;2-O
Abstract
We introduce a family of binary array codes of size t x n, correcting multiple phased burst erasures of size t. The codes achieve maximal co rrecting capability, i.e., being considered as codes over CF (2(t)) th ey are MDS. The length of the codes is n = (l=1)Sigma(L) ((T)(l)) wher e L is a constant or is slowly growing in t. The complexity of encodin g and decoding is proportional to rnmL, where r is the number of corre ctable erasures, and m is the smallest number such that 2(t) = 1 modul e m. This compares favorably with the complexity of decoding codes obt ained from the shortened Reed-Solomon codes having the same parameters .