Article
Licensed
Unlicensed
Requires Authentication
Bent functions on a finite Abelian group
-
O. A. LOGACHEV
, A. A. SALNIKOV and V. V. YASHCHENKO
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 1997
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Bent functions on a finite Abelian group
- On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials
- On the number of minimal tests checking the block circuits of parity functions for closings
- On closed classes of polynomials over finite fields
- Action of the automorphism group of a finite graded partially ordered set on the levels
- Classes of directed graded graphs with polynomially solvable cardinality Steiner problem
- The total vertex separation number of a graph
- A new equilibrium in cyclic games on graphs
- On a type of assigning a colour from given sets to the edges of a graph
Articles in the same Issue
- Bent functions on a finite Abelian group
- On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials
- On the number of minimal tests checking the block circuits of parity functions for closings
- On closed classes of polynomials over finite fields
- Action of the automorphism group of a finite graded partially ordered set on the levels
- Classes of directed graded graphs with polynomially solvable cardinality Steiner problem
- The total vertex separation number of a graph
- A new equilibrium in cyclic games on graphs
- On a type of assigning a colour from given sets to the edges of a graph