DocumentCode
3067496
Title
Array codes for correction of criss-cross errors
Author
Blaum, Mario ; Bruck, Jehoshua
Author_Institution
IBM Almaden Res. Center, San Jose, CA, USA
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
412
Abstract
We present MDS array codes of size (p-1)×(p-1), p is a prime number, that can correct any row or column in error without a priori knowledge of what type of error that has 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
Keywords
Boolean functions; arrays; coding errors; computational complexity; decoding; error correction codes; MDS array codes; code size; column error; criss-cross errors correction; decoding algorithm complexity; encoding algorithm complexity; error correction codes; exclusive-OR operations; prime number; row error; slopes; Arithmetic; Binary codes; Decoding; Encoding; Error correction; Error correction codes; Galois fields; Parity check codes; Polynomials; Table lookup;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613349
Filename
613349
Link To Document