Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Characterization of Negabent Functions and Construction of Bent-Negabent Functions with Maximum Algebraic Degree (1205.6568v1)

Published 30 May 2012 in cs.IT and math.IT

Abstract: We present necessary and sufficient conditions for a Boolean function to be a negabent function for both even and odd number of variables, which demonstrate the relationship between negabent functions and bent functions. By using these necessary and sufficient conditions for Boolean functions to be negabent, we obtain that the nega spectrum of a negabent function has at most 4 values. We determine the nega spectrum distribution of negabent functions. Further, we provide a method to construct bent-negabent functions in $n$ variables ($n$ even) of algebraic degree ranging from 2 to $\frac{n}{2}$, which implies that the maximum algebraic degree of an $n$-variable bent-negabent function is equal to $\frac{n}{2}$. Thus, we answer two open problems proposed by Parker and Pott and by St\v{a}nic\v{a} \textit{et al.} respectively.

Citations (35)

Summary

We haven't generated a summary for this paper yet.