论文信息 - There are many good periodically time-varying convolutional codes

There are many good periodically time-varying convolutional codes

It is shown empirically that the number of good periodically time-varying convolutional codes increases exponentially with the period for any set of parameters. Hence, they can be used to enhance the security of cryptosystems without sacrificing error correction capability. It is shown that some periodically time-varying convolutional codes improve the free distance compared with fixed codes. >

Pil Joong Lee

[1] Pil Lee. Futher Results on Rate 1/N Convolutional Code Constructions with Minimum Required SNR Criterion , 1986, IEEE Trans. Commun..

[2] David G. Daut,et al. New short constraint length convolutional code constructions for selected rational rates , 1982, IEEE Trans. Inf. Theory.

[3] Jean Conan. The Weight Spectra of Some Short Low-Rate Convolutional Codes , 1984, IEEE Trans. Commun..

[4] Jean Conan. On the distance properties of Paaske's class of rates 2/3 and 3/4 convolutional codes , 1984, IEEE Trans. Inf. Theory.

[5] J. Bibb Cain,et al. Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[6] Andrew J. Viterbi,et al. Convolutional Codes and Their Performance in Communication Systems , 1971 .

[7] Lin-nan Lee,et al. Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[8] Gianfranco L. Pierobon,et al. Codes for zero spectral density at zero frequency , 1984, IEEE Trans. Inf. Theory.

[9] Pil Lee. New Short Constraint Length, Rate 1/N Convolutional Codes Which Minimize the Required SNR for Given Desired Bit Error Rates , 1985, IEEE Trans. Commun..

[10] M. Mooser. Some periodic convolutional codes better than any fixed code , 1983, IEEE Trans. Inf. Theory.

[11] Daniel J. Costello. Free distance bounds for convolutional codes , 1974, IEEE Trans. Inf. Theory.