暂无分享,去创建一个
[1] Igor E. Shparlinski. Finite Fields: Theory and Computation , 1999 .
[2] Kenneth W. Shum,et al. A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound , 2001, IEEE Trans. Inf. Theory.
[3] Yuan Zhou. Introduction to Coding Theory , 2010 .
[4] Henning Stichtenoth,et al. Topics in Geometry, Coding Theory and Cryptography (Algebra and Applications) , 2006 .
[5] Robert Bix. Topics in Geometry , 1993 .
[6] K. Conrad,et al. Finite Fields , 2018, Series and Products in the Development of Mathematics.
[7] Stéphane Ballet,et al. Curves with Many Points and Multiplication Complexity in Any Extension of Fq , 1999 .
[8] Venkatesan Guruswami,et al. Hitting Sets for Low-Degree Polynomials with Optimal Density , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[9] Victor Shoup,et al. New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[10] Henning Stichtenoth,et al. Algebraic function fields and codes , 1993, Universitext.
[11] H. Lenstra. Finding isomorphisms between finite fields , 1991 .
[12] H. Perfect. Topics in geometry , 1963 .
[13] Rudolf Lide,et al. Finite fields , 1983 .
[14] Shirley Dex,et al. JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .
[15] H. Niederreiter,et al. Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .
[16] Alain Poli. A Deterministic Constructin of Normal Bases With Complexity O(n³+n log n log(log n) log q) , 1995, J. Symb. Comput..
[17] Nader H. Bshouty,et al. Testers and their applications , 2014, ITCS.
[18] Nader H. Bshouty. Multilinear Complexity is Equivalent to Optimal Tester Size , 2013, Electron. Colloquium Comput. Complex..
[19] H. Stichtenoth,et al. On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields , 1996 .