Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Yu. V. Tarannikov"'
Publikováno v:
Designs, Codes and Cryptography.
A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on a modifica
Autor:
I. P. Baksova, Yu. V. Tarannikov
Publikováno v:
Moscow University Mathematics Bulletin. 77:131-135
Autor:
Claude Carlet, Yu. V. Tarannikov
Publikováno v:
Designs, Codes and Cryptography. 25:263-279
We introduce the notion of covering sequence of a Boolean function, related to the derivatives of the function. We give complete characterizations of balancedness, correlation immunity and resiliency of Boolean functions by means of their covering se
Autor:
Yu. V. Tarannikov
Publikováno v:
Operations Research and Discrete Analysis ISBN: 9789401063951
The density of a Boolean function f of n arguments is the quantity p (f) = Wf /2 n , where W f is the number of vectors of length n at which f equals 1. The function f is called 1 -balanced if |Wf 1 -Wf 2 | ≤ l for each of its subfunctions f 1 and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::597b0742e22064912000257db8f46378
https://doi.org/10.1007/978-94-011-5678-3_21
https://doi.org/10.1007/978-94-011-5678-3_21
Autor:
Yu. V. Tarannikov
Publikováno v:
Discrete Mathematics and Applications. 5