A CLASS OF ARRAY CODES CORRECTING MULTIPLE COLUMN ERASURES

Authors
KEREN O LITSYN S
Citation
O. Keren et S. Litsyn, A CLASS OF ARRAY CODES CORRECTING MULTIPLE COLUMN ERASURES, IEEE transactions on information theory, 43(6), 1997, pp. 1843-1851
Citations number
14
Categorie Soggetti
Information Science & Library Science","Engineering, Eletrical & Electronic
Journal title
IEEE transactions on information theory → ACNP
ISSN journal
00189448
Volume
43
Issue
6
Year of publication
1997
Pages
1843 - 1851
Database
ISI
SICI code
0018-9448(1997)43:6<1843:ACOACC>2.0.ZU;2-B
Abstract
A family of binary array codes of size (p - 1) x n, p a prime, correct ing multiple column erasures is proposed. The codes coincide with a su bclass of shortened Reed-Solomon codes and achieve the maximum possibl e correcting capability. Complexity of encoding and decoding is propor tional to rnp, where r is the number of correctable erasures, i.e., is simpler than the Forney decoding algorithm. The length n of the codes is at most 2p - 1, that is, twice as big as the length of the Blaum-R oth codes having comparable decoding complexity.