We present 2-dimensional interleaving schemes, with repetition, for correcting 2-dimensional bursts (or clusters) of errors, where a cluster of errors is characterized by its area. A recent application of correction of 2-dimensional clusters appeared in the context holographic storage. Known interleaving schemes are based on arrays of integers with the property that every connected component of area t consists of distinct integers. Namely, they are based on the use of 1-error-correcting codes. We extend the concept by allowing repetitions within the arrays, hence, providing a trade-off between the error-correcting capability of the codes and the degree of the interleaving schemes.
By: Mario Blaum, Jehoshua Bruck (CA Inst. of Technology) and Patrick G. Farrell (The Univ. Manchester, England)
Published in: RJ10047 in 1996
This Research Report is not available electronically. Please request a copy from the contact listed below. IBM employees should contact ITIRC for a copy.
