A fast algorithm to compute irreducible and primitive polynomials in finite fields
暂无分享,去创建一个
[1] Trieu-Kien Truong,et al. VLSI Architectures for Computing Multiplications and Inverses in GF(2m) , 1983, IEEE Transactions on Computers.
[2] H. T. Kung,et al. Systolic VLSI Arrays for Polynomial GCD Computation , 1984, IEEE Transactions on Computers.
[3] Joan Borrell,et al. Improving the Time Complexity of the Computation of Irreducible and Primitive Polynomials in Finite Fields , 1991, AAECC.
[4] Masao Kasahara,et al. A Method for Solving Key Equation for Decoding Goppa Codes , 1975, Inf. Control..
[5] Harald Niederreiter,et al. Introduction to finite fields and their applications: Preface , 1994 .
[6] H. Lenstra. Finding isomorphisms between finite fields , 1991 .
[7] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[8] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[9] Joachim von zur Gathen,et al. Constructing Normal Bases in Finite Fields , 1990, J. Symb. Comput..
[10] Michael J. Quinn,et al. Designing Efficient Algorithms for Parallel Computers , 1987 .