Results 31 to 40 of about 51,964 (308)
On connected Boolean functions
Discrete Applied Mathematics, 1999 Various classes of Boolean functions are introduced: connected, strongly connected, geodetic, convex, strongly convex and concordant. They are characterized by some properties of the subgraph of the Boolean hypercube induced by the (false) true points of a function.
Ekin, O., Hammer, P. L., Kogan, A.
openaire +3 more sources
Hardware prototyping of Boolean function classification schemes for lossless data compression [PDF]
, 2004 In this paper, we present the realization of Boolean function classification schemes on Altera FLEX10K FPGA device for lossless data compression. The compression algorithm is performed by incorporating Boolean function classification into Huffman coding.
Sulaiman, MS +4 more
core +1 more source
Relationship between correlation immune and weight of H Boolean functions
Tongxin xuebao, 2012 The Boolean function derivative and e-derivative which together with the derivative so that the weight of Boolean functions can be directly clear characterized and defined as the tools for research and deep into the internal structure of Boolean function
Jing-lian HUANG, Zhuo WANG
doaj +2 more sources
Partial Boolean Functions With Exact Quantum Query Complexity One
Entropy, 2021 We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean function with exact quantum query complexity 1. Using the first characterization, we present all n-bit partial Boolean functions that depend on n bits and can be
Guoliang Xu, Daowen Qiu
doaj +1 more source
A Method for Determining the Affine Equivalence of Boolean Functions
IEEE Access, 2019 Determining the affine equivalence of Boolean functions has significant applications in circuit and cryptography. Previous methods for determining this require a large amount of computation when Boolean functions are bent functions or when the truth ...
Ziyu Wang +3 more
doaj +1 more source
The Zhegalkin Polynomial of Multiseat Sole Sufficient Operator
Моделирование и анализ информационных систем, 2023 Among functionally complete sets of Boolean functions, sole sufficient operators are of particular interest. They have a wide range of applicability and are not limited to the two-seat case.
Leonid Y. Bystrov, Egor V. Kuzmin
doaj +1 more source
CoRR, 2021 First edition originally published April 2014, in hardcover book format by Cambridge University Press, and electronically on the author's website.
openaire +2 more sources
On the q-bentness of Boolean functions [PDF]
Designs, Codes and Cryptography, 2018 For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of basis. Klapper conjectured that no Boolean function exists with its $q$-transform coefficients equal to $\pm 2^{n/2}$ (
Zhixiong Chen 0002 +2 more
openaire +3 more sources
Linear approximation of a vectorial Boolean function using quantum computing [PDF]
, 2020 A vectorial Boolean function takes multi-bit input and produces a multi-bit output. According to the input parameters, a vectorial Boolean function can be linear or non-linear.
A. K. Malviya, N. Tiwari
core +1 more source
A Characterization of Generalized Boolean Functions Employed in CDMA Communications [PDF]
International Journal of Mathematical, Engineering and Management SciencesIn design of secure cryptosystems and CDMA communications, the negabent functions play a significant role. The generalized Boolean functions have been extensively studied by Schmidt and established several important results in this setup.
Deep Singh +3 more
doaj +1 more source