New double-byte error-correcting codes for memory systems

• Published in: IEEE transactions on information theory Vol. 44; no. 3; pp. 1152 - 1163
• Main Authors: Gui-Liang Feng, Xinwen Wu, Rao, T.R.N.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01-05-1998; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Binary system; Codes; Computer errors; Computer memory; Computer science; Decoding; Error correction codes; Galois fields; Information theory; Linear code; Mathematics; Parity check codes; Redundancy; Upper bound
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/18.669260

Double-byte error-correcting codes over GF(q) were constructed by Dumer (1981, 1988, 1992, 1995), which have the parameters n=q/sup m-1/, r/spl les/2m+[m-1/3], m=2, 3, ..., when q is even, and have the parameters n=q/sup m/, r/spl les/2m+[m/3]+1, m=2; 3, ..., when q is odd, respectively. We construct a class of double-byte error-correcting codes over GF(2/sup i/), which have the following parameters: n=q/sup m/, r/spl les/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.