CONDITIONALLY DOUBLE-INFORMATION-ERROR-CORRECTING CODES OF EXPONENT HIGHER THAN TWO

Peter Farkaš - John Baylis

   In [1] a new family of error detection codes called Weighted Sum Codes was proposed. In [2] it was noted that these codes are equivalent to lengthened Reed Solomon Codes, and shortened versions of lengthened Reed Solomon codes over GF(2^h/2). It was also shown that it is possible to use these codes for correction of one error in each codeword over GF(2^h/2). In [3] a generalization of Weighted Sum Codes was made allowing the correction of more than two erasures in each codeword. A large family of codes with a relatively long codeword length and a simple decoding procedure were introduced. In this paper we present a new encoding and decoding method, which is based on an error detecting code and a CDECMGWSC e > 3 over any finite field of characteristic 2.

Keywords: error correcting codes, weighted sum codes, Reed Solomon codes

[full-paper]