A class of burst error-correcting array codes

The usual (k_{2} + 1) \times (k_{1} + 1) array code, in which the last row and the last column contain redundant bits, can correct any single error. However, if the bits are read diagonally instead of horizontally, the code can correct bursts of errors. It is shown that the (_{k}2 + 1) \times (k_{1} + 1) array code with diagonal readout can correct any burst of length up to k_{1} if and only if k_{2} \geq 2(k_{1} - 1) .