Blaum, Mario and Bruck, Jehoshua (2000) MDS array codes for correcting a signle criss-cross error. IEEE Transactions on Information Theory, 46 (3). pp. 1068-1077. ISSN 0018-9448 http://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit00b
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit00b
We present a family of maximum-distance separable (MDS) array codes of size (p-1)×(p-1), p a prime number, and minimum criss-cross distance 3, i.e., the code is capable of correcting any row or column in error, without a priori knowledge of what type of error occurred. The complexity of the encoding and decoding algorithms is lower than that of known codes with the same error-correcting power, since our algorithms are based on exclusive-OR operations over lines of different slopes, as opposed to algebraic operations over a finite field. We also provide efficient encoding and decoding algorithms for errors and erasures.
|Additional Information:||© Copyright 2000 IEEE. Reprinted with permission. Manuscript received March 29, 1998; revised August 6, 1999. This work was supported in part by an IBM University Partnership Award, an NSF Young Investigator Award CCR-9457811, and by a Sloan Research Fellowship. The material in this correspondence was presented in part at the IEEE International Symposium on Information Theory, Ulm, Germany, 1077. Communicated by E. Soljanin, Associate Editor for Coding Techniques.|
|Subject Keywords:||Array codes, criss-cross errors, error-correcting codes, MDS codes, rank errors|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||11 Aug 2006|
|Last Modified:||26 Dec 2012 08:58|
Repository Staff Only: item control page