Published January 1999
| public
Journal Article
Open
X-code: MDS array codes with optimal encoding
- Creators
- Xu, Lihao
-
Bruck, Jehoshua
Chicago
Abstract
We present a new class of MDS (maximum distance separable) array codes of size n×n (n a prime number) called X-code. The X-codes are of minimum column distance 3, namely, they can correct either one column error or two column erasures. The key novelty in X-code is that it has a simple geometrical construction which achieves encoding/update optimal complexity, i.e., a change of any single information bit affects exactly two parity bits. The key idea in our constructions is that all parity symbols are placed in rows rather than columns.
Additional Information
© Copyright 2006 IEEE. Reprinted with permission. Manuscript received November 12, 1997; revised July 16, 1998. This work was supported in part by the NSF Young Investigator Award CCR-9457811, by the Sloan Research Fellowship, and by DARPA through an agreement with NASA/OSAT. Communicated by A. Barg, Associate Editor for Coding Theory.Files
XULieeetit99b.pdf
Files
(182.9 kB)
Name | Size | Download all |
---|---|---|
md5:c6b1fee0d26f78d19c407583ffec76b5
|
182.9 kB | Preview Download |
Additional details
- Eprint ID
- 5194
- Resolver ID
- CaltechAUTHORS:XULieeetit99b
- Created
-
2006-10-04Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field