论文信息 - Optimal codes for correcting single errors and detecting adjacent errors

Optimal codes for correcting single errors and detecting adjacent errors

Optimal codes that correct single errors and detect double errors within nibbles of power of two length are presented. For each n, a code of length n with the largest possible dimension which corrects single errors and detects double adjacent errors is presented. The problem of constructing optimal codes which correct single errors and detect double adjacent errors within nibbles of length l is discussed. >

Tuvi Etzion

[1] Neal Zierler,et al. Two-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect , 1960, Inf. Control..

[2] Chin-Long Chen,et al. Error-Correcting Codes with Byte Error-Detection Capability , 1983, IEEE Trans. Computers.

[3] Jehoshua Bruck,et al. A Note on "A Systematic (12, 8) Code for Correcting Single Errors and Detecting Adjacent Errors" , 1994, IEEE Trans. Computers.

[4] C. L. Chen. Byte-Oriented Error-Correcting Codes for Semiconductor Memory Systems , 1986, IEEE Transactions on Computers.

[5] Philippe Delsarte,et al. Four Fundamental Parameters of a Code and Their Combinatorial Significance , 1973, Inf. Control..

[6] Jack K. Wolf,et al. A Systematic (12, 8) Code for Correcting Single Errors and Detecting Adjacent Errors , 1990, IEEE Trans. Computers.

[7] Alexander A. Davydov,et al. An alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory , 1991, IEEE Trans. Inf. Theory.

[8] J. Goethals. UNIFORMLY PACKED CODES , 1975 .