By Topic

Array codes correcting a two-dimensional cluster of errors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Breitbach, M. ; Dept. of Inf. Technol., Ulm Univ., Germany ; Bossert, M. ; Zyablov, V. ; Sidorenko, V.

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

Published in:

Information Theory, IEEE Transactions on  (Volume:44 ,  Issue: 5 )