Xu, Lihao and Bruck, Jehoshua (1999) X-code: MDS array codes with optimal encoding. IEEE Transactions on Information Theory, 45 (1). pp. 272-276. ISSN 0018-9448 http://resolver.caltech.edu/CaltechAUTHORS:XULieeetit99b
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 178Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:XULieeetit99b
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.
| Item Type: | Article |
|---|---|
| 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. |
| Subject Keywords: | Array codes, balanced computation, MDS codes, optimal updates, update complexity |
| Record Number: | CaltechAUTHORS:XULieeetit99b |
| Persistent URL: | http://resolver.caltech.edu/CaltechAUTHORS:XULieeetit99b |
| Alternative URL: | http://dx.doi.org/10.1109/18.746809 |
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 5194 |
| Collection: | CaltechAUTHORS |
| Deposited By: | Archive Administrator |
| Deposited On: | 04 Oct 2006 |
| Last Modified: | 26 Dec 2012 09:04 |
Repository Staff Only: item control page
