论文信息 - Algorithms to enumerate codewords for DC2-constrained channels

Algorithms to enumerate codewords for DC2-constrained channels

We introduce a new method for enumerating codewords that can be applied to DC/sup 2/-constrained channels. Based on this method, two efficient algorithms for evaluating the number of codewords with specified characteristics are developed. Computer calculation results show that these algorithms are significantly more computationally efficient than other techniques developed to date.

Ivan J. Fair | Yan Xin | I. Fair | Y. Xin

[1] John Riordan,et al. Introduction to Combinatorial Analysis , 1958 .

[2] Simon Litsyn,et al. Asymptotically exact bounds on the size of high-order spectral-null codes , 1999, IEEE Trans. Inf. Theory.

[3] Paul H. Siegel,et al. High-order spectral-null codes - Construction and bounds , 1994, IEEE Trans. Inf. Theory.

[4] Carlo M. Monti,et al. Codes with a multiple spectral null at zero frequency , 1989, IEEE Trans. Inf. Theory.

[5] Bella Bose,et al. On efficient high-order spectral-null codes , 1999, IEEE Trans. Inf. Theory.

[6] John Riordan,et al. Introduction to Combinatorial Analysis , 1959 .