Linear Complexity in Coding Theory
暂无分享,去创建一个
[1] Richard M. Wilson,et al. On the minimum distance of cyclic codes , 1986, IEEE Trans. Inf. Theory.
[2] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[3] Rainer A. Rueppel,et al. Linear Complexity and Random Sequences , 1985, EUROCRYPT.
[4] James L. Massey,et al. Determining the burst-correcting limit of cyclic codes , 1980, IEEE Trans. Inf. Theory.
[5] Solomon W. Golomb,et al. Shift Register Sequences , 1981 .
[6] Richard E. Blahut. Transform Techniques for Error Control Codes , 1979, IBM J. Res. Dev..
[7] Carlos R. P. Hartmann,et al. Generalizations of the BCH Bound , 1972, Inf. Control..
[8] R. Blahut. Theory and practice of error control codes , 1983 .
[9] Tadao Kasami. Comments on 'Determining the burst-correcting limit of cyclic codes' by H. J. Matt, and J. L. Massey , 1981, IEEE Trans. Inf. Theory.