Finite field for scientists and engineers
Finite field for scientists and engineers
Cyclic codes with few weights and Niho exponents
Journal of Combinatorial Theory Series A
A Generalization of Niho's Theorem
Designs, Codes and Cryptography
Almost perfect nonlinear power functions on GF(2n): the Welch case
IEEE Transactions on Information Theory
Niho type cross-correlation functions via dickson polynomials and Kloosterman sums
IEEE Transactions on Information Theory
New pairs of m-sequences with 4-level cross-correlation
Finite Fields and Their Applications
New cyclic difference sets with Singer parameters
Finite Fields and Their Applications
On three weights in cyclic codes with two zeros
Finite Fields and Their Applications
A Generalization of Niho's Theorem
Designs, Codes and Cryptography
The solutions of the third power sum equation for niho type decimations
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Hi-index | 0.00 |
Assume that d=1(modq-1). We study the number of solutions to (x+1)^d=x^d+1 in GF(q^2). In addition, we give a simple proof of the fact that the cross-correlation function between two m-sequences, which differ by a decimation of this type, is at least four-valued.