English

On minimal distance between q-ary bent functions

Combinatorics 2016-06-09 v1 Information Theory math.IT

Abstract

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

Cite

@article{arxiv.1606.02430,
  title  = {On minimal distance between q-ary bent functions},
  author = {Vladimir N. Potapov},
  journal= {arXiv preprint arXiv:1606.02430},
  year   = {2016}
}

Comments

2 pages

R2 v1 2026-06-22T14:20:14.892Z