Author :
Feng, Gui-Liang ; Wu, Xinwen ; Rao, T.R.N.
Author_Institution :
Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA
Abstract :
Double-byte error-correcting codes over GF(q) were constructed by Dumer (1981, 1988, 1992, 1995), which have the parameters n=qm-1 , r⩽2m+[m-1/3], m=2, 3, ..., when q is even, and have the parameters n=qm, r⩽2m+[m/3]+1, m=2; 3, ..., when q is odd, respectively. We construct a class of double-byte error-correcting codes over GF(2i), which have the following parameters: n=q m, r⩽2m+[m/3]+1, m=3, 4, .... So our constructions reduce the code redundancy of Dumer by one symbol, and we eliminate the disparity in code redundancies obtained for even and odd q. A decoding procedure for our codes is also considered
Keywords :
Galois fields; digital storage; error correction codes; Galois fields; code length; code parameters; code redundancy reduction; decoding; double-byte error-correcting codes; memory systems; q-ary code; Computer errors; Decoding; Error correction codes; Galois fields; Information theory; Linear code; Mathematics; Parity check codes; Redundancy; Upper bound;
