Array codes correcting a two-dimensional cluster of errors

Author

Breitbach, Markus ; Bossert, Martin ; Zyablov, Viktor ; Sidorenko, Vladimir

Author_Institution

Dept. of Inf. Technol., Ulm Univ., Germany

Volume

44

Issue

5

fYear

1998

fDate

9/1/1998 12:00:00 AM

Firstpage

2025

Lastpage

2031

Abstract

A novel construction method is presented for array codes correcting a single rectangular error cluster of size b₁×b₂ or less. Encoding is done in such a way that parity check symbols are calculated row-or 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 n₁=b₁2^b2, n₂=b ₂2^b1, and r=3b₁b₂ redundancy symbols which is close to the generalized Singleton bound r⩾2b₁b₂. Its encoding and decoding complexity are low

Keywords

computational complexity; decoding; error correction codes; redundancy; array codes; code construction method; decoding algorithms; decoding complexity; encoding complexity; generalized Singleton bound; parity check symbols; phased burst; redundancy symbols; single rectangular error cluster; two-dimensional error cluster correction; Data communication; Data structures; Decoding; Error correction codes; Interleaved codes; Land mobile radio; Magnetic devices; OFDM; Parity check codes; Redundancy;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.705587

Filename

705587