A class of array codes correcting multiple column erasures

Osnat Keren, Simon Litsyn

Research output: Contribution to journalArticlepeer-review

Abstract

A family of binary array codes of size (p - 1) × n, p a prime, correcting multiple column erasures is proposed. The codes coincide with a subclass of shortened Reed-Solomon codes and achieve the maximum possible correcting capability. Complexity of encoding and decoding is proportional 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-Roth codes having comparable decoding complexity.

Original languageEnglish
Pages (from-to)1843-1851
Number of pages9
JournalIEEE Transactions on Information Theory
Volume43
Issue number6
DOIs
StatePublished - 1997

Keywords

  • Array codes
  • Burst correction
  • Decoding
  • Erasures correction
  • Reed-Solomon codes

Fingerprint

Dive into the research topics of 'A class of array codes correcting multiple column erasures'. Together they form a unique fingerprint.

Cite this