DocumentCode :
1410343
Title :
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 b1×b2 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 n1=b12b2, n2=b 22b1, and r=3b1b2 redundancy symbols which is close to the generalized Singleton bound r⩾2b1 b2. 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
Link To Document :
بازگشت