๐ฎ
๐ฎ
The Ethereal
On minimal distance between q-ary bent functions
June 08, 2016 ยท The Ethereal ยท ๐ International Symposium "Problems of Redundancy in Information and Control Systems"
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Vladimir N. Potapov
arXiv ID
1606.02430
Category
math.CO: Combinatorics
Cross-listed
cs.IT
Citations
4
Venue
International Symposium "Problems of Redundancy in Information and Control Systems"
Last Checked
2 months ago
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$.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Combinatorics
๐ฎ
๐ฎ
The Ethereal
On cap sets and the group-theoretic approach to matrix multiplication
๐ฎ
๐ฎ
The Ethereal
Generalized Twisted Gabidulin Codes
๐ฎ
๐ฎ
The Ethereal
Tables of subspace codes
๐ฎ
๐ฎ
The Ethereal
Classification of weighted networks through mesoscale homological features
๐ฎ
๐ฎ
The Ethereal