X-Code: MDS Array Codes with Optimal Encoding

Xu, L. and Bruck, J. (1997) X-Code: MDS Array Codes with Optimal Encoding. Technical Report. California Institute of Technology. [CaltechPARADISE:1997.ETR020]

Full text available as:

	PDF (Adobe PDF (1.4MB)) - Requires Adobe Acrobat Reader or other PDF viewer.
	Postscript - Requires a viewer, such as GhostView

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.

EPrint Type:	Monograph (Technical Report)
Additional Information:	[Alternate URL: http://www.paradise.caltech.edu/papers/etr020.ps]
Subjects:	All Records
ID Code:	35
Deposited By:	Jehoshua Bruck
Deposited On:	03 September 2002
Record Number:	CaltechPARADISE:1997.ETR020
Official 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.

Archive Staff Only: edit this record