Optimal interleaving schemes for correcting 2-D cluster errors
Wen‐Qing Xu, Solomon W. Golomb · 2004
Given an m/spl times/n array of n single-random-error-correcting codewords of length m, we present optimal interleaving schemes that achieve maximum possible interleaving distance t =/spl lfloor//spl radic/2n/spl rfloor/ for n/spl les//spl lceil/m/sup 2//2/spl rceil/, and t = m+/spl lfloor/(n-/spl lceil/m/sup 2//2/spl rceil/)/m/spl rfloor/ for n/spl ges//spl lceil/m/sup 2//2/spl rceil/. These interleaving schemes provide maximum burst error-correcting power without requiring prior knowledge of the size or shape of an error burst.