[LIVRE][B] Handbook of finite fields
GL Mullen, D Panario - 2013 - api.taylorfrancis.com
The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …
book for the theory and applications of finite fields. It is not intended to be an introductory …
Sequence sets in wireless communication systems: A survey
JM Velazquez-Gutierrez… - … Surveys & Tutorials, 2016 - ieeexplore.ieee.org
Sequences and their properties have been studied widely in different research areas
because they have useful characteristics which are used in many applications. Correlation …
because they have useful characteristics which are used in many applications. Correlation …
A new characterization of semi-bent and bent functions on finite fields
We present a new characterization of semi-bent and bent quadratic functions on finite fields.
First, we determine when a GF (2)-linear combination of Gold functions Tr (x 2 i+ 1) is semi …
First, we determine when a GF (2)-linear combination of Gold functions Tr (x 2 i+ 1) is semi …
Bent and hyper-bent functions in polynomial form and their link with some exponential sums and Dickson polynomials
S Mesnager - IEEE transactions on information theory, 2011 - ieeexplore.ieee.org
Bent functions are maximally nonlinear Boolean functions with an even number of variables.
They were introduced by Rothaus in 1976. For their own sake as interesting combinatorial …
They were introduced by Rothaus in 1976. For their own sake as interesting combinatorial …
Constructions of quadratic bent functions in polynomial forms
In this correspondence, the constructions and enumerations of all bent functions
represented by a polynomial form of f (x)=/spl Sigma//sub i= 1//sup n/2-1/c/sub i/Tr (x/sup 1+ …
represented by a polynomial form of f (x)=/spl Sigma//sub i= 1//sup n/2-1/c/sub i/Tr (x/sup 1+ …
[CITATION][C] Boolean functions for cryptography and coding theory
C Carlet - 2021 - Cambridge University Press
Generalized Kasami sequences: the large set
X Zeng, JQ Liu, L Hu - IEEE Transactions on Information …, 2007 - ieeexplore.ieee.org
In this correspondence, new binary sequence families F k of period 2 n-1 are constructed for
even n and any k with gcd (k, n)= 2 if n/2 is odd or gcd (k, n)= 1 if n/2 is even. The distribution …
even n and any k with gcd (k, n)= 2 if n/2 is odd or gcd (k, n)= 1 if n/2 is even. The distribution …
A new class of bent and hyper-bent Boolean functions in polynomial forms
S Mesnager - Designs, Codes and Cryptography, 2011 - Springer
Bent functions are maximally nonlinear Boolean functions and exist only for functions with
even number of inputs. This paper is a contribution to the construction of bent functions over …
even number of inputs. This paper is a contribution to the construction of bent functions over …
Optimal codebooks from binary codes meeting the Levenshtein bound
In this paper, a generic construction of codebooks based on binary codes is introduced. With
this generic construction, a few previous constructions of optimal codebooks are extended …
this generic construction, a few previous constructions of optimal codebooks are extended …
On quadratic bent functions in polynomial forms
H Hu, D Feng - IEEE transactions on information theory, 2007 - ieeexplore.ieee.org
PubTeX output 2007.06.11:1507 Page 1 2610 IEEE TRANSACTIONS ON INFORMATION
THEORY, VOL. 53, NO. 7, JULY 2007 V. CONCLUDING REMARKS In this correspondence, one …
THEORY, VOL. 53, NO. 7, JULY 2007 V. CONCLUDING REMARKS In this correspondence, one …