About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISIT 1997
Conference paper
Array codes for correction of criss-cross errors
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. © 1997 IEEE.