Published May 1, 2000
| public
Journal Article
Open
MDS array codes for correcting a signle criss-cross error
- Creators
- Blaum, Mario
-
Bruck, Jehoshua
Abstract
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.Files
BLAieeetit00b.pdf
Files
(285.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:e88f293f4ea11fe5ea7d7cc0430b6a18
|
285.9 kB | Preview Download |
Additional details
- Eprint ID
- 4290
- Resolver ID
- CaltechAUTHORS:BLAieeetit00b
- Created
-
2006-08-11Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field