Published 1997
| public
Book Section - Chapter
Array Codes for Correction of Criss-Cross Errors
- Creators
- Blaum, Mario
-
Bruck, Jehoshua
Chicago
Abstract
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.
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.Additional details
- Eprint ID
- 28859
- DOI
- 10.1109/ISIT.1997.613349
- Resolver ID
- CaltechAUTHORS:20120119-113410577
- NSF Young Investigator Award
- CCR-9457811
- Sloan Research Fellowship
- DARPA BMDO through an agreement with NASA/OSAT
- Created
-
2012-01-19Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 5848868