论文信息 - A simple strategy for constructing a class of DC-free error-correcting codes with minimum distance 4

A simple strategy for constructing a class of DC-free error-correcting codes with minimum distance 4

A class of DC-free codes with minimum distance 4 which offer very simple encoding and decoding procedures is presented. Spectral analysis shows that in addition to being DC-free they offer strong spectral suppression at low frequencies. A comparison with similar codes in the literature shows that they provide a good compromise solution to the design of practically realizable, high-rate, DC-free error-correcting codes with strong low frequency suppression. >

John J. O'Reilly | Adrian Popplewell

[1] H. C. Ferreira. Lower bounds on the minimum hamming distance achievable with runlengh constrained or DC free block codes and the synthesis of a (16,8) D min = 4 DC free block code , 1984 .

[2] Gianfranco Cariolaro,et al. Invited paper Analysis of codes and spectra calculations , 1983 .

[3] A. Popplewell,et al. Class of disparity reducing transmission codes with embedded error protection , 1990 .

[4] Robert H. Deng,et al. DC-free coset codes , 1988, IEEE Trans. Inf. Theory.

[5] K. W. Cattermole. Invited paper Principles of digital line coding , 1983 .

[6] Mario Blaum. A (16, 9, 6, 5, 4) error-correcting DC free block code , 1988, IEEE Trans. Inf. Theory.

[7] Simon Litsyn,et al. Error-correcting codes with bounded running digital sum , 1991, IEEE Trans. Inf. Theory.

[8] A. Popplewell,et al. Reduced Complexity Encoding and Decoding Algorithms for a Class of Runlength Limited Error Control Codes , 1993, Proceedings. IEEE International Symposium on Information Theory.

[9] A. Popplewell,et al. New class of runlength-limited error-control codes with minimum distance 4 , 1993 .

[10] J. Pierce,et al. Spectra and Efficiency of Binary Codes Without DC , 1972, IEEE Trans. Commun..