Codes correcting phased burst erasures

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

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 correcting capability, i.e., being considered as codes over GF (2() they are MDS. The length of the codes is n = y (] L(l) where L is a constant or is slowly growing in t. The complexity of encoding and decoding is proportional to rnmL, where r is the number of correctable erasures, and m is the smallest number such that 2( = 1 modulo m. This compares favorably with the complexity of decoding codes obtained from the shortened Reed-Solomon codes having the same parameters. Index Terms-Array codes, complexity of decoding, decoding erasures, Reed-Solomon codes.

Original languageEnglish
Pages (from-to)416-420
Number of pages5
JournalIEEE Transactions on Information Theory
Volume44
Issue number1
DOIs
StatePublished - 1998
Externally publishedYes

Fingerprint

Dive into the research topics of 'Codes correcting phased burst erasures'. Together they form a unique fingerprint.

Cite this