Optimal interleaving schemes for correcting 2-D cluster errors

Given an m×n array of n single-random-error-correcting codewords of length m, we present optimal interleaving schemes that achieve maximum possible interleaving distance t =└√2n┘ for n≤┌m²/2┐, and t = m+└(n-┌m²/2┐)/m┘ for n≥┌m²/2┐. These interleaving schemes provide maximum burst error-correcting power without requiring prior knowledge of the size or shape of an error burst.