default search action
Finite Fields and Their Applications, Volume 63
Volume 63, March 2020
- Kwang Ho Kim, Sihem Mesnager:
Solving x2k+1+x+a=0 in F2n with gcd(n, k)=1. 101630 - Hadi Kharaghani, Sho Suda:
Commutative association schemes obtained from twin prime powers, Fermat primes, Mersenne primes. 101631 - Luis A. Medina, L. Brehsner Sepúlveda, César A. Serna-Rapello:
Value distribution of elementary symmetric polynomials and its perturbations over finite fields. 101632 - Ting Yao, Shixin Zhu, Xiaoshan Kai:
Asymptotically good ZprZps-additive cyclic codes. 101633 - Kai-Uwe Schmidt:
Highly nonlinear functions over finite fields. 101640 - Kangquan Li, Longjiang Qu, Yue Zhou:
A link between two classes of permutation polynomials. 101641 - Changhao Chen:
Finite field analogue of restriction theorem for general measures. 101642 - Meng Cao, Jianlian Cui:
New stabilizer codes from the construction of dual-containing matrix-product codes. 101643 - Tao Feng, Ran Tao:
An infinite family of m-ovoids of Q(4, q). 101644 - Ilya D. Shkredov:
Any small multiplicative subgroup is not a sumset. 101645 - Yongho Sin, Kwangyon Kim, Ryul Kim, Songchol Han:
Constructing new differentially 4-uniform permutations from known ones. 101646 - Tekgül Kalayci, Henning Stichtenoth, Alev Topuzoglu:
Irreducible factors of a class of permutation polynomials. 101647 - Yansheng Wu, Qin Yue, Shuqin Fan:
Self-reciprocal and self-conjugate-reciprocal irreducible factors of xn - λ and their applications. 101648 - Omran Ahmadi, Khosro Monsef-Shokri:
A note on the stability of trinomials over finite fields. 101649 - Weijun Fang, Fang-Wei Fu:
Optimal cyclic (r, δ) locally repairable codes with unbounded length. 101650 - Daniele Bartoli, Marco Timpanella:
A family of planar binomials in characteristic 2. 101651
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.