Answers are grounded in this paper and cite their sources.
Correction of two-dimensional (2-D) and three-dimensional (3-D) error bursts finds wide applications in secure data handling such as 2-D and 3-D magnetic and optical data storage, charged-coupled devices (CCDs), 2-D barcodes, and information hiding in digital images and video sequences, to name a few. In this paper, we present a new 2-D interleaving technique, called successive packing, to combat 2-D spot burst errors, with potential for extending to multidimensional (M-D) interleaving. Square arrays of 2/sup n/ /spl times/ 2/sup n/ are considered. It is shown that the proposed successive packing technique can spread any error burst of 2/sup k/ /spl times/ 2/sup k/ (with 1 /spl les/ k /spl les/ n-1), 2/sup k/ /spl times/ 2/sup k+1/ (with 0 /spl les/ k /spl les/ n-1), and 2/sup k+1/ /spl times/ 2/sup k/ (with 0 /spl les/ k /spl les/ n-1) effectively so that the error burst can be corrected with some simple random-error-correction code (provided the error-correction code is available). It is further shown that the technique is optimal for combating all the above-mentioned error bursts in the sense that the interleaving degree reaches its lower bound. This implies that the algorithm needs to be implemented only once for a given 2-D array and is thereafter optimal for the set of error bursts having different sizes. A performance comparison between the proposed method and some existing techniques is given and the future research is discussed.
No takes yet. Share an insight, caveat, or question.
Shi et al. (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: