The Principle of Re-Encoding Parity Check Symbols and Its Application to the Correction of Two-Dimensional Clusters of Errors

M. Breitbach, M. Bossert, V. Zyablov, V. Sidorenko

Research output: Contribution to journalArticlepeer-review

Abstract

A novel construction method is presented for array codes correcting a single rectangular error cluster of size b1 × b2 or less. Encoding is done in such a way that parity check symbols calculated by rows resp. columns itselves are each 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 = b12b2, n2 = b22b1 and r = 3b1b2 redundancy symbols which is close to the generalized Singleton bound r ≥ 2b1b2. Its encoding and decoding complexity are low.

Original languageEnglish
Pages (from-to)143-148
Number of pages6
JournalITG-Fachbericht
Issue number146
Publication statusPublished - 1998
Externally publishedYes

Fingerprint

Dive into the research topics of 'The Principle of Re-Encoding Parity Check Symbols and Its Application to the Correction of Two-Dimensional Clusters of Errors'. Together they form a unique fingerprint.

Cite this