pith. sign in

arxiv: 1606.02430 · v1 · pith:2OAAPCB6new · submitted 2016-06-08 · 🧮 math.CO · cs.IT· math.IT

On minimal distance between q-ary bent functions

classification 🧮 math.CO cs.ITmath.IT
keywords bentdistancefunctionsminimalcdotsdistinctequalfunction
0
0 comments X
read the original abstract

The minimal Hamming distance between distinct $p$-ary bent functions of $2n$ variables is proved to be $p^n$ for any prime $p$. It is shown that the number of $p$-ary bent functions at the distance $p^n$ from the quadratic bent function is equal to $p^n(p^{n-1}+1)\cdots(p+1)(p-1)$ as $p>2$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.