Burst error correction capability of square array codes

The burst error correcting capabilities of binary block array codes have been investigated by various authors, and it has proved by M. Blaum (1990) that the best single burst correcting codes belong to a class of array codes. The author contributes to the body of knowledge on array codes by proving that the length b of a burst error correctable by a square array code is bounded by b2-1/2n+1 when a diagonal readout with r=1 is used. It is also shown that the burst error correction efficiency of square array codes tends to 1/2 for large n.