Array codes correcting a two-dimensional cluster of errors

Markus Breitbach, Martin Bossert, Viktor Zyablov, Vladimir Sidorenko

Research output: Contribution to journalArticlepeer-review

25 Citations (Scopus)

Abstract

A novel construction method is presented for array codes correcting a single rectangular error cluster of size 61 X 62 or less. Encoding is done in such a way that parity check symbols are calculated rowor columnwise which are a word of a one-dimensional code correcting a phased burst. These parity check symbols are not transmitted but can be calculated by the receiver. Corresponding decoding algorithms are given. A code is constructed with maximum size n1 = b12&2, b2 = b22, and r = 36i&2 redundancy symbols which is close to the generalized Singleton bound r > 26162- Its encoding and decoding complexity are low.

Original languageEnglish
Pages (from-to)2025-2031
Number of pages7
JournalIEEE Transactions on Information Theory
Volume44
Issue number5
DOIs
Publication statusPublished - 1998
Externally publishedYes

Keywords

  • Array codes, generalized singleton bound, hamming bound, two-dimensional cluster correcting codes

Fingerprint

Dive into the research topics of 'Array codes correcting a two-dimensional cluster of errors'. Together they form a unique fingerprint.

Cite this