Blaum, Mario and Bruck, Jehoshua (1997) Array Codes for Correction of Criss-Cross Errors. In: 1997 IEEE International Symposium on Information Theory, Proceedings. IEEE , New York, NY, p. 412. ISBN 0-7803-3956-8 http://resolver.caltech.edu/CaltechAUTHORS:20120119-113410577
Full text is not posted in this repository. Consult Related URLs below.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20120119-113410577
We present MDS array codes of size (p-1)×(p-1), p is a prime number, that can correct any row or column in error without a priori knowledge of what type of error that has 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.
|Item Type:||Book Section|
|Additional Information:||© 1997 IEEE. Date of Current Version: 06 August 2002. Supported in part by the NSF Young Investigator Award CCR-9457811, by the Sloan Research Fellowship and by DARPA and BMDO through an agreement with NACA/OSAT.|
|Other Numbering System:|
|Official Citation:||Blaum, M.; Bruck, J.; , "Array codes for correction of criss-cross errors," Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on , vol., no., pp.412, 29 Jun-4 Jul 1997 doi: 10.1109/ISIT.1997.613349 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=613349&isnumber=13396|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Ruth Sustaita|
|Deposited On:||19 Jan 2012 20:57|
|Last Modified:||23 Aug 2016 10:09|
Repository Staff Only: item control page