A family of efficient burst-correcting array codes
Mario Blaum · IEEE Transactions on Information Theory · 1990
A family of binary burst correcting array codes that are defined as follows is discussed: consider an n/sub 1/*nn/sub 2/ array with n/sub 1/=4u+ nu +2 and n/sub 2/=6u+2 nu +5, u>or=1, nu >or=0, nu not=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 n/sub 1/. The burst-correcting efficiency of this family tends to 4/5 as u to infinity . 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.>