English
Related papers

Related papers: Constructions of Almost Optimal Resilient Boolean …

200 papers

A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean…

Machine Learning · Computer Science 2014-07-10 Dana Dachman-Soled , Vitaly Feldman , Li-Yang Tan , Andrew Wan , Karl Wimmer

We study Boolean functions of an arbitrary number of input variables that can be realized by simple iterative constructions based on constant-size primitives. This restricted type of construction needs little global coordination or control…

Neural and Evolutionary Computing · Computer Science 2016-06-16 Christos Papadimitrou , Samantha Petti , Santosh Vempala

Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root…

Other Computer Science · Computer Science 2013-09-17 Debesh K. Das , Debabani Chowdhury , Bhargab B. Bhattacharya , Tsutomu Sasao

A recipe is presented for constructing band-limited superoscillating functions that exhibit arbitrarily high frequencies over arbitrarily long intervals.

Mathematical Physics · Physics 2019-07-02 Masud Mansuripur , Per K. Jakobsen

We show that an optimized projection functions method can automatically construct maximally localized Wannier functions even for bands with nontrivial topology. We demonstrate this method on a tight-binding model of a two-dimensional…

Materials Science · Physics 2016-10-05 Jamal I. Mustafa , Sinisa Coh , Marvin L. Cohen , Steven G. Louie

A function $F:\mathbb{F}_2^n\rightarrow \mathbb{F}_2^n$, $n=2m$, can have at most $2^n-2^m$ bent component functions. Trivial examples are obtained as $F(x) = (f_1(x),\ldots,f_m(x),a_1(x),\ldots, a_m(x))$, where…

Number Theory · Mathematics 2020-10-09 Nurdagül Anbar , Tekgül Kalaycı , Wilfried Meidl , László Mérai

We give improved and almost optimal testers for several classes of Boolean functions on $n$ inputs that have concise representation in the uniform and distribution-free model. Classes, such as $k$-junta, $k$-linear functions, $s$-term DNF,…

Data Structures and Algorithms · Computer Science 2023-06-22 Nader H. Bshouty

We study the nonlinearity of functions defined on a finite field with 2^m elements which are the trace of a polynomial of degree 7 or more general polynomials. We show that for m odd such functions have rather good nonlinearity properties.…

Number Theory · Mathematics 2007-05-23 Eric Férard , François Rodier

Almost perfect nonlinear (APN) functions play an important role in the design of block ciphers as they offer the strongest resistance against differential cryptanalysis. Despite more than 25 years of research, only a limited number of APN…

Combinatorics · Mathematics 2020-12-01 Christian Kaspers , Yue Zhou

Boolean functions with high algebraic immunity are important cryptographic primitives in some stream ciphers. In this paper, two methodologies for constructing binary minimal codes from sets, Boolean functions and vectorial Boolean…

Information Theory · Computer Science 2020-04-13 Hang Chen , Cunsheng Ding , Sihem Mesnager , Chunming Tang

We present necessary and sufficient conditions for a Boolean function to be a negabent function for both even and odd number of variables, which demonstrate the relationship between negabent functions and bent functions. By using these…

Information Theory · Computer Science 2012-05-31 Wei Su , Alexander Pott , Xiaohu Tang

When predicting scalar responses in the situation where the explanatory variables are functions, it is sometimes the case that some functional variables are related to responses linearly while other variables have more complicated…

Methodology · Statistics 2012-11-29 Heng Lian

The purpose of this paper is to present the extended definitions and characterizations of the classical notions of APN and maximum nonlinear Boolean functions to deal with the case of mappings from a finite group K to another one N with the…

Cryptography and Security · Computer Science 2011-09-26 Laurent Poinsot , Alexander Pott

We construct a function for almost-complex Riemannian manifolds. Non-vanishing of the function for the almost-complex structure implies the almost-complex structure is not integrable. Therefore the constructed function is an obstruction for…

General Mathematics · Mathematics 2019-03-11 Jun Ling

For linear regression models who are not exactly sparse in the sense that the coefficients of the insignificant variables are not exactly zero, the working models obtained by a variable selection are often biased. Even in sparse cases,…

Methodology · Statistics 2014-07-17 Lu Lin , Lixing Zhu , Yujie Gai

We address the problem of finding optimal strategies for computing Boolean symmetric functions. We consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and we…

Information Theory · Computer Science 2009-11-18 Hemant Kowshik , P. R. Kumar

Algebraic immunity of Boolean function $f$ is defined as the minimal degree of a nonzero $g$ such that $fg=0$ or $(f+1)g=0$. Given a positive even integer $n$, it is found that the weight distribution of any $n$-variable symmetric Boolean…

Cryptography and Security · Computer Science 2012-02-07 Hui Wang , Jie Peng , Yuan Li , Haibin Kan

In this paper we propose a method for the approximation of high-dimensional functions over finite intervals with respect to complete orthonormal systems of polynomials. An important tool for this is the multivariate classical analysis of…

Numerical Analysis · Mathematics 2022-01-31 Daniel Potts , Michael Schmischke

This paper is dedicated to the unique continuation properties of the solutions to nonlinear variational problems. Our analysis covers the case of nonlinear autonomous functionals depending on the gradient, as well as more general double…

Analysis of PDEs · Mathematics 2024-08-02 Lorenzo Ferreri , Luca Spolaor , Bozhidar Velichkov

In this paper, we focus on applications in machine learning, optimization, and control that call for the resilient selection of a few elements, e.g. features, sensors, or leaders, against a number of adversarial denial-of-service attacks or…

Optimization and Control · Mathematics 2017-11-01 Vasileios Tzoumas , Konstantinos Gatsis , Ali Jadbabaie , George J. Pappas