Improved upper bound for the relative distance between a Boolean function and the set of k-dimensional functions

DOI10.1007/S10559-015-9760-7zbMATH Open1400.94211OpenAlexW2337204745MaRDI QIDQ904418FDOQ904418

Authors: A. N. Alekseychuk 

Publication date: 13 January 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-015-9760-7

Recommendations

• Algebraically degenerate approximations of Boolean functions
• Limit distribution of the Hamming distance from the random Boolean function to the set of affine functions
• scientific article; zbMATH DE number 5062518
• An upper bound for the relative influence of variables on Boolean functions
• On approximation of maximally nonlinear Boolean functions by almost linear functions

zbMATH Keywords

bent functionWalsh-Hadamard transformcorrelation cryptanalysis\(k\)-dimensional Boolean functionBonami-Beckner inequality

Mathematics Subject Classification ID

Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Cites Work

• Boolean functions in coding theory and cryptography. Translated from the Russian by Svetla Nikova
• Title not available (Why is that?)
• Title not available (Why is that?)
• Testing Fourier dimensionality and sparsity
• Algebraically degenerate approximations of Boolean functions
• An improved test of Boolean functions for \(k\)-dimensionality

Cited In (3)

• Refining the upper bound for the cardinality of the definition domain of universal functions for a class of linear Boolean functions
• Title not available (Why is that?)
• The Boolean map distance: theory and efficient computation

This page was built for publication: Improved upper bound for the relative distance between a Boolean function and the set of \(k\)-dimensional functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q904418)