An alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory

Author

Davydov, Alexander A. ; Tombak, Leonid M.

Author_Institution

Inst. for Problems of Cybernetics, Acad. of Sci., Moscow, USSR

Volume

37

Issue

3

fYear

1991

fDate

5/1/1991 12:00:00 AM

Firstpage

897

Lastpage

902

Abstract

The Pi code constructed by V.I. Panchenko (1987) is studied. The Pi code as an alternative to the Hamming code in the class of single-error-correcting and double-error-detecting codes (SEC-DED codes) is also considered. The Pi code has a smaller number of words of weight 4 and provides a larger probability of triple-independent-error detection than the shortened Hamming code with the same parameters. Shortening algorithms for the Pi code are proposed, and parity check matrices of the (39,32), (72,64), (137,128) shortened Pi codes are constructed. The obtained codes can detect byte errors of length 4. The parity check matrices of the Pi code have more 1´s in rows than corresponding matrices of the Hamming code. The Pi code is a reasonable alternative to the Hamming code in the class of SEC-DED codes.

Keywords

error correction codes; error detection codes; integrated memory circuits; Hamming code; Pi code; SEC-DED codes; double-error-detecting; parity check matrices; semiconductor memory; shortening algorithms; single-error-correcting; triple-independent-error detection; Error correction codes; Informatics; Linear code; Parity check codes; Protection; Redundancy; Semiconductor memory;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.79958

Filename

79958