Multiple burst-correcting array codes

Two families of binary linear multiple-burst-correcting array codes are presented. The codes consist of all possible n₁ ×n₂ arrays over GF(2), where the columns have even parity and the rows belong to any given code of length n ₂ and minimum distance 2t. It is shown that if the bits are read out diagonally instead of horizontally, each diagonal followed by the preceding one (viewed cyclically), then the code can correct up to t bursts of length ⩽n₁ if and only if n₂⩾tn₁+1. If each diagonal is followed by the next one, the code can correct up to t bursts of length ⩽n₁-1 if and only if n₂⩾2t(n-2)+1. For t=1 some of these results are already known. Decoding algorithms are presented, and the case t=1 is discussed in more detail