By Topic

A family of efficient burst-correcting array codes

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
$33 $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

1 Author(s)
M. Blaum ; IBM Almaden Res. Center, San Jose, CA, USA

A family of binary burst correcting array codes that are defined as follows is discussed: consider an n1×n n2 array with n1=4u+ν+2 and n2=6u+2ν+5, u⩾1, ν⩾0, ν≠1 where each row and column has even parity. The bits are read diagonally starting from the upper-left corner. The columns are viewed cyclically, i.e. the array is a cylinder. If one diagonal has been read out, one proceeds with the second diagonal preceding it. It is proven that the codes of this type can correct any burst of length up to n1. The burst-correcting efficiency of this family tends to 4/5 as u→∞. As a comparison, the burst-correcting efficiency of other families of array codes tends to 2/3; the same is true for Fire codes. A simple decoding algorithm for the codes is also presented

Published in:

IEEE Transactions on Information Theory  (Volume:36 ,  Issue: 3 )