On $q$-nearly bent Boolean functions

May 01, 2019 ยท The Ethereal ยท ๐Ÿ› Discrete Applied Mathematics

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Zhixiong Chen, Andrew Klapper arXiv ID 1905.00150 Category math.CO: Combinatorics Cross-listed cs.CR Citations 2 Venue Discrete Applied Mathematics Last Checked 3 months ago
Abstract
For each non-constant Boolean function $q$, Klapper introduced the notion of $q$-transforms of 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. In this work we discuss the existence of $q$-nearly bent functions, a new family of Boolean functions characterized by the $q$-transform. Let $q$ be a non-affine Boolean function. We prove that any balanced Boolean functions (linear or non-linear) are $q$-nearly bent if $q$ has weight one, which gives a positive answer to an open question (whether there exist non-affine $q$-nearly bent functions) proposed by Klapper. We also prove a necessary condition for checking when a function isn't $q$-nearly bent.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Combinatorics

๐Ÿ”ฎ ๐Ÿ”ฎ The Ethereal

Tables of subspace codes

Daniel Heinlein, Michael Kiermaier, ... (+2 more)

math.CO ๐Ÿ› arXiv ๐Ÿ“š 94 cites 10 years ago