CaltechAUTHORS
  A Caltech Library Service

X-Code: MDS Array Codes with Optimal Encoding

Xu, Lihao and Bruck, Jehoshua (1997) X-Code: MDS Array Codes with Optimal Encoding. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:1997.ETR020

[img]
Preview
PDF (Adobe PDF (1.4MB))
See Usage Policy.

1406Kb
[img]
Preview
Postscript
See Usage Policy.

366Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:1997.ETR020

Abstract

We present a new class of MDS array codes of size n x 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, namely, 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:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription
http://www.paradise.caltech.edu/papers/etr020.psPublisherUNSPECIFIED
Group:Parallel and Distributed Systems Group
Record Number:CaltechPARADISE:1997.ETR020
Persistent URL:http://resolver.caltech.edu/CaltechPARADISE:1997.ETR020
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26054
Collection:CaltechPARADISE
Deposited By: Imported from CaltechPARADISE
Deposited On:03 Sep 2002
Last Modified:26 Dec 2012 13:52

Repository Staff Only: item control page