OpenAlex ·
Further Results on Sum-Freedom of Binary and $q$-ary Functions
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.31489
- Original
- Read it at the publisher
- Topics
Abstract
The notion of sum-freedom of binary functions was introduced recently by C. Carlet as a generalization of the APN functions used in cryptography; the $q$-ary version of the notion is a natural extension. For each integer $k$ with $0\le k\le n$, there is a $k$th order sum-free function on $\Bbb F_{2^n}$. It is also known that when $k/n$ is not close to 0 or 1, the multiplicative inverse function on $\Bbb F_{2^n}$ is not $k$th order sum-free. We generalize these two results to $q$-ary functions. APN functions have a coding theoretic characterization. We generalize the characterization to sum-free functions of arbitrary order over any finite field. It is well known that the Welch functions is 2nd order sum-free. We give an alternative proof for this result which leads to a more general algebraic question. We also investigate that the 3rd order sum-freedom of the Welch function and power functions of algebraic degree 3. We formulate a conjecture about the 3rd order sum-freedom of the Welch function which is supported by strong numerical evidence.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Artificial Intelligence
Get the few papers worth your time in Artificial Intelligence every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.