Results 31 to 40 of about 51,980 (308)

The Zhegalkin Polynomial of Multiseat Sole Sufficient Operator

open access: yesМоделирование и анализ информационных систем, 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

Inference of a probabilistic Boolean network from a single observed temporal sequence

open access: yes, 2007
The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs) from observed temporal sequences of network states.
Edward R. Dougherty   +7 more
core   +1 more source

A Method for Determining the Affine Equivalence of Boolean Functions

open access: yesIEEE 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

Analysis of Boolean Functions

open access: yesCoRR, 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]

open access: yesDesigns, 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

Autocorrelations of Vectorial Boolean Functions [PDF]

open access: yes, 2021
Recently, BarOn et al. introduced at Eurocrypt'19 a new tool, called the differential-linear connectivity table (DLCT), which allows for taking into account the dependency between the two subciphers E0 and E1 involved in differential-linear attacks. This paper presents a theoretical characterization of the DLCT, which corresponds to an autocorrelation ...
Canteaut, Anne   +6 more
openaire   +3 more sources

Deciphering transcriptional plasticity in pancreatic ductal adenocarcinoma reveals alterations in sensory neuron innervation

open access: yesMolecular Oncology, EarlyView.
Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova   +14 more
wiley   +1 more source

A Characterization of Generalized Boolean Functions Employed in CDMA Communications [PDF]

open access: yesInternational Journal of Mathematical, Engineering and Management Sciences
In 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

Dirichlet product for boolean functions [PDF]

open access: yesJournal of Applied Mathematics and Computing, 2016
Boolean functions play an important role in many symmetric cryp-tosystems and are crucial for their security. It is important to design boolean functions with reliable cryptographic properties such as balanced-ness and nonlinearity. Most of these properties are based on specific structures such as Möbius transform and Algebraic Normal Form.
Nitaj, Abderrahmane   +2 more
openaire   +5 more sources

An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs [PDF]

open access: yes, 2008
Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input correspondence is unknown and finding support-reducing bound sets.
Kettle, Neil   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy