A Caltech Library Service

MDS Array Codes for Correcting Criss-Cross Errors

Blaum, Mario and Bruck, Jehoshua (1997) MDS Array Codes for Correcting Criss-Cross Errors. California Institute of Technology . (Unpublished)

See Usage Policy.

PDF (Adobe PDF (1.8MB))
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription
Group:Parallel and Distributed Systems Group
Record Number:CaltechPARADISE:1997.ETR019
Persistent URL:
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:26055
Deposited By: Imported from CaltechPARADISE
Deposited On:03 Sep 2002
Last Modified:26 Dec 2012 13:52

Repository Staff Only: item control page