A (16, 9, 6, 5, 4) error-correcting DC free block code
暂无分享,去创建一个
A (2n, k, l, c, d) DC free binary block code is a code of length 2n, constant weight n, 2/sup k/ codewords, maximum runlength of a symbol l, maximum accumulated charge c, and minimum distance d. The purpose of this code is to achieve DC freeness and error correction at the same time. The goal is to keep the rate k/2n and d large and l and c small. Of course, these are conflicting goals. H.C. Ferreira (IEEE Trans. Magn., vol.MAG-20, no.5, p.881-3, 1984) presented a (16, 8, 8, 5, 4) DC free code. Here, a (16, 9, 6, 5, 4) DC free code is presented. Easy encoding and decoding algorithms are also given. >
[1] ANDRIES E. BROUWER,et al. A few new constant weight codes (Corresp.) , 1980, IEEE Trans. Inf. Theory.
[2] Andries E. Brouwer,et al. A few new constant weight codes , 1979 .
[3] 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 .