MDS Array Codes for Correcting Criss-Cross Errors

Blaum, M. and Bruck, J. (1997) MDS Array Codes for Correcting Criss-Cross Errors. Technical Report. California Institute of Technology. [CaltechPARADISE:1997.ETR019]

Full text available as:

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

Abstract

We present a family of MDS array codes of size (p - 1) x ( 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 apriori 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. Tl'e also provide efficient encoding and decoding algorithms for errors and erasures.

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