7 research outputs found
Metrical properties of the set of bent functions in view of duality
In the paper, we give a review of metrical properties of the entire set of bent functions and its significant subclasses of self-dual and anti-self-dual bent functions. We present results for iterative construction of bent functions in n + 2 variables based on the concatenation of four bent functions and consider related open problem proposed by one of the authors. Criterion of self-duality of such functions is discussed. It is explored that the pair of sets of bent functions and affine functions as well as a pair of sets of self-dual and anti-self-dual bent functions in n > 4 variables is a pair of mutually maximally distant sets that implies metrical duality. Groups of automorphisms of the sets of bent functions and (anti-)self-dual bent functions are discussed. The solution to the problem of preserving bentness and the Hamming distance between bent function and its dual within automorphisms of the set of all Boolean functions in n variables is considered
The group of automorphisms of the set of self-dual bent functions
A bent function is a Boolean function in even number of variables which is on the maximal Hamming distance from the set of affine Boolean functions. It is called self-dual if it coincides with its dual. It is called anti-self-dual if it is equal to the negation of its dual. A mapping of the set of all Boolean functions in n variables to itself is said to be isometric if it preserves the Hamming distance. In this paper we study isometric mappings which preserve self-duality and anti-self-duality of a Boolean bent function. The complete characterization of these mappings is obtained for n>2. Based on this result, the set of isometric mappings which preserve the Rayleigh quotient of the Sylvester Hadamard matrix, is characterized. The Rayleigh quotient measures the Hamming distnace between bent function and its dual, so as a corollary, all isometric mappings which preserve bentness and the Hamming distance between bent function and its dual are described
Π ΠΌΠ΅ΡΡΠΈΡΠ΅ΡΠΊΠΈΡ ΡΠ²ΠΎΠΉΡΡΠ²Π°Ρ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° ΡΠ°ΠΌΠΎΠ΄ΡΠ°Π»ΡΠ½ΡΡ Π±Π΅Π½Ρ-ΡΡΠ½ΠΊΡΠΈΠΉ
ΠΡΠΈΠ²ΠΎΠ΄ΠΈΡΡΡ ΠΎΠ±Π·ΠΎΡ ΠΈΠ·Π²Π΅ΡΡΠ½ΡΡ
ΠΌΠ΅ΡΡΠΈΡΠ΅ΡΠΊΠΈΡ
ΡΠ²ΠΎΠΉΡΡΠ² ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° ΡΠ°ΠΌΠΎΠ΄ΡΠ°Π»ΡΠ½ΡΡ
Π±Π΅Π½Ρ- ΡΡΠ½ΠΊΡΠΈΠΉ. ΠΠ΅Π½Ρ-ΡΡΠ½ΠΊΡΠΈΡ Π½Π°Π·ΡΠ²Π°Π΅ΡΡΡ ΡΠ°ΠΌΠΎΠ΄ΡΠ°Π»ΡΠ½ΠΎΠΉ, Π΅ΡΠ»ΠΈ ΠΎΠ½Π° ΡΠΎΠ²ΠΏΠ°Π΄Π°Π΅Ρ ΡΠΎ ΡΠ²ΠΎΠ΅ΠΉ Π΄ΡΠ°Π»ΡΠ½ΠΎΠΉ Π±Π΅Π½Ρ-ΡΡΠ½ΠΊΡΠΈΠ΅ΠΉ, ΠΈ Π°Π½ΡΠΈ-ΡΠ°ΠΌΠΎΠ΄ΡΠ°Π»ΡΠ½ΠΎΠΉ, Π΅ΡΠ»ΠΈ ΡΠΎΠ²ΠΏΠ°Π΄Π°Π΅Ρ Ρ ΠΎΡΡΠΈΡΠ°Π½ΠΈΠ΅ΠΌ ΡΠ²ΠΎΠ΅ΠΉ Π΄ΡΠ°Π»ΡΠ½ΠΎΠΉ. ΠΡΠΈΠ²ΠΎΠ΄ΠΈΡΡΡ ΠΏΠΎΠ»Π½ΡΠΉ ΡΠΏΠ΅ΠΊΡΡ ΡΠ°ΡΡΡΠΎΡΠ½ΠΈΠΉ Π₯ΡΠΌΠΌΠΈΠ½Π³Π° ΠΌΠ΅ΠΆΠ΄Ρ ΡΠ°ΠΌΠΎΠ΄ΡΠ°Π»ΡΠ½ΡΠΌΠΈ Π±Π΅Π½Ρ-ΡΡΠ½ΠΊΡΠΈΡΠΌΠΈ ΠΈΠ· ΠΊΠ»Π°ΡΡΠ° ΠΡΠΉΠΎΡΠ°Π½Π° β ΠΠ°ΠΊΠ€Π°ΡΠ»Π°Π½Π΄Π°. ΠΠ°ΡΡΡΡ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΡ, ΠΊΠ°ΡΠ°ΡΡΠΈΠ΅ΡΡ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΠ·Π°ΡΠΈΠΈ Π±ΡΠ»Π΅Π²ΡΡ
ΡΡΠ½ΠΊΡΠΈΠΉ, Π½Π°Ρ
ΠΎΠ΄ΡΡΠΈΡ
ΡΡ Π½Π° ΠΌΠ°ΠΊΡΠΈΠΌΠ°Π»ΡΠ½ΠΎ Π²ΠΎΠ·ΠΌΠΎΠΆΠ½ΠΎΠΌ ΡΠ΄Π°Π»Π΅Π½ΠΈΠΈ ΠΎΡ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° ΡΠ°ΠΌΠΎΠ΄ΡΠ°Π»ΡΠ½ΡΡ
Π±Π΅Π½Ρ-ΡΡΠ½ΠΊΡΠΈΠΉ. ΠΠΏΠΈΡΠ°Π½Ρ Π³ΡΡΠΏΠΏΡ Π°Π²ΡΠΎΠΌΠΎΡΡΠΈΠ·ΠΌΠΎΠ² ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ² ΡΠ°ΠΌΠΎΠ΄ΡΠ°Π»ΡΠ½ΡΡ
ΠΈ Π°Π½ΡΠΈ-ΡΠ°ΠΌΠΎΠ΄ΡΠ°Π»ΡΠ½ΡΡ
Π±Π΅Π½Ρ-ΡΡΠ½ΠΊΡΠΈΠΉ ΠΎΡ n ΠΏΠ΅ΡΠ΅ΠΌΠ΅Π½Π½ΡΡ
, Π°Π²ΡΠΎΠΌΠΎΡΡΠΈΠ·ΠΌΡ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° Π±ΡΠ»Π΅Π²ΡΡ
ΡΡΠ½ΠΊΡΠΈΠΉ ΠΎΡ n ΠΏΠ΅ΡΠ΅ΠΌΠ΅Π½Π½ΡΡ
, ΠΊΠΎΡΠΎΡΡΠ΅ ΠΌΠ΅Π½ΡΡΡ ΠΌΠ΅ΡΡΠ°ΠΌΠΈ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° ΡΠ°ΠΌΠΎΠ΄ΡΠ°Π»ΡΠ½ΡΡ
ΠΈ Π°Π½ΡΠΈ-ΡΠ°ΠΌΠΎΠ΄ΡΠ°Π»ΡΠ½ΡΡ
Π±Π΅Π½Ρ- ΡΡΠ½ΠΊΡΠΈΠΉ, ΠΈΠ·ΠΎΠΌΠ΅ΡΡΠΈΡΠ½ΡΠ΅ ΠΎΡΠΎΠ±ΡΠ°ΠΆΠ΅Π½ΠΈΡ, ΡΠΎΡ
ΡΠ°Π½ΡΡΡΠΈΠ΅ Π½Π΅ΠΈΠ·ΠΌΠ΅Π½Π½ΡΠΌ ΠΎΡΠ½ΠΎΡΠ΅Π½ΠΈΠ΅ Π ΡΠ»Π΅Ρ ΠΊΠ°ΠΆΠ΄ΠΎΠΉ Π±ΡΠ»Π΅Π²ΠΎΠΉ ΡΡΠ½ΠΊΡΠΈΠΈ ΠΎΡ n ΠΏΠ΅ΡΠ΅ΠΌΠ΅Π½Π½ΡΡ
. ΠΠ°ΡΡΡΡ Ρ
Π°ΡΠ°ΠΊΡΠ΅ΡΠΈΠ·Π°ΡΠΈΡ Π²ΡΠ΅Ρ
ΠΈΠ·ΠΎ- ΠΌΠ΅ΡΡΠΈΡΠ½ΡΡ
ΠΎΡΠΎΠ±ΡΠ°ΠΆΠ΅Π½ΠΈΠΉ, ΡΠΎΡ
ΡΠ°Π½ΡΡΡΠΈΡ
ΠΌΠ°ΠΊΡΠΈΠΌΠ°Π»ΡΠ½ΡΡ Π½Π΅Π»ΠΈΠ½Π΅ΠΉΠ½ΠΎΡΡΡ ΠΈ ΡΠ°ΡΡΡΠΎΡΠ½ΠΈΠ΅ Π₯ΡΠΌΠΌΠΈΠ½Π³Π° ΠΌΠ΅ΠΆΠ΄Ρ ΠΊΠ°ΠΆΠ΄ΠΎΠΉ Π±Π΅Π½Ρ-ΡΡΠ½ΠΊΡΠΈΠΉ ΠΈ Π΄ΡΠ°Π»ΡΠ½ΠΎΠΉ ΠΊ Π½Π΅ΠΉ
An extensive English language bibliography on graph theory and its applications
Bibliography on graph theory and its application