Binary two-dimensional arrays are considered, where the patches of errors contain more than one symbol from the same codeword, i.e. arrays with repetitions. The relative digit positions in each codeword are taken into account when performing interleaving, and burst error-correcting codes are used instead of random error-correcting codes.
Previous research into cluster-error correction in two-dimensional data arrays has concentrated on using interleaved random-error correcting codes. The value of the work reported in this letter lies in showing that more efficient cluster-error correction is possible if burst-error correcting codes are used instead. The greater efficiency arises from the fact that either smaller arrays for a given cluster size can be used, or that larger cluster sizes for a given array size can be corrected. RAE_import_type : Journal article RAE_uoa_type : Electrical and Electronic Engineering
