About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISIT 1994
Conference paper
Correcting two-dimensional clusters by interleaving of symbols
Abstract
The purpose of this paper is to present techniques for two dimensional interleaving of error-correcting codes in order to correct two dimensional bursts (or clusters) of errors. We present a novel method for correcting two dimensional bursts by interleaving symbols (of say, a Reed-Solomon code) in such a way that the amount of redundancy is minimized. The basic idea is to tile the two dimensional array of bits with symbols of a given area such that the number of different codes required to correct bursts of a given size is minimized. Our constructions, in many cases achieve or get very close to the lower bound on the amount of redundancy bits. © 1994 IEEE.