![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Finite Fields and Their Applications, Volume 41
Volume 41, September 2016
- Yun Fan, Liang Zhang:
Iso-orthogonality and Type-II duadic constacyclic codes. 1-23 - Fabio Enrique Brochero Martínez
, Lucas Reis
:
Elements of high order in Artin-Schreier extensions of finite fields Fq. 24-33 - Bence Csajbók
, Corrado Zanella:
On scattered linear sets of pseudoregulus type in PG(1, qt). 34-54 - Alan Adolphson, Steven Sperber:
A-hypergeometric series and the Hasse-Witt matrix of a hypersurface. 55-63 - Yi Ouyang
, Jinbang Yang
:
On a conjecture of Wan about limiting Newton polygons. 64-71 - Massimo Giulietti
, Maria Montanucci
, Giovanni Zini
:
On maximal curves that are not quotients of the Hermitian curve. 72-88 - Rohit Gupta
, R. K. Sharma:
Some new classes of permutation trinomials over finite fields with even characteristic. 89-96 - Zahra Sepasdar
, Kazem Khashyarmanesh:
Characterizations of some two-dimensional cyclic codes correspond to the ideals of F[x, y]/<xs-1, y2k-1>. 97-112 - Chunming Tang, Yanfeng Qi:
Special values of Kloosterman sums and binomial bent functions. 113-131 - Daniele Bartoli
, Massimo Giulietti
, Giovanni Zini
:
On monomial complete permutation polynomials. 132-158 - Hongxi Tong:
Repeated-root constacyclic codes of length klapb over a finite field. 159-173 - Yao Sun, Zhenyu Huang
, Dingkang Wang, Dongdai Lin:
An improvement over the GVW algorithm for inhomogeneous polynomial systems. 174-192 - Ferruh Özbudak
, Buket Özkaya
:
A minimum distance bound for quasi-nD-cyclic codes. 193-222
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.