Vectorial Dual-Bent Functions Overview
- Vectorial dual-bent functions are mappings where every nonzero linear form yields a bent function and the scalar duals coherently structure an m-dimensional Fₚ-vector space.
- Structural conditions like Condition A and homogeneity regimes ensure regularity or weak regularity, facilitating secondary constructions and controlled cross-correlation in codebooks.
- Explicit p-ary and Boolean concatenation methods link these functions to combinatorial designs, Gaussian sums, and optimal linear code constructions.
Vectorial dual-bent functions are vectorial bent mappings whose scalar component duals close into a coherent vectorial structure. In the standard -ary formulation, a vectorial function is vectorial bent when every nonzero linear form is bent, and it is vectorial dual-bent when the family of duals , together with the zero function, forms an -dimensional -vector space of bent functions; equivalently, there exist a vectorial bent and a permutation such that for all (Wang et al., 2023). In the weakly regular setting one may assemble the scalar duals into a unique vectorial mapping 0 characterized by 1 (Bapić, 2022). A closely related Boolean viewpoint organizes designated component quadruples so that duals satisfy affine identities such as 2, which provides a binary, componentwise realization of dual-bent structure (Polujan et al., 2023).
1. Formal framework
For a scalar 3-ary function 4, the generalized Walsh–Hadamard transform is
5
The function is bent when 6 for all 7. In the weakly regular case,
8
with 9 independent of 0, and 1 is the dual bent function. For vectorial 2, each nonzero 3 defines a scalar component 4, and vectorial bentness requires every such component to be bent (Wang et al., 2023).
Two equivalent descriptions of vectorial dual-bentness are standard in the recent literature. One states that there exist a vectorial bent 5 and a permutation 6 on the nonzero output coefficients such that
7
for all 8. Another, used prominently in odd-characteristic work, is that for 9, there exists a vectorial bent 0 and a permutation 1 of 2 such that the dual of
3
equals 4 for all 5 (Wang et al., 2022). Proposition 1 of (Wang et al., 2023) further states that for a fixed permutation 6, the corresponding vectorial dual 7 is unique.
In the Boolean concatenation setting, the dual notion is componentwise rather than field-trace based. If 8 is organized from bent Boolean components, the “vectorial dual” is understood as 9, and prescribed affine relations among the component duals define the relevant dual-bent behavior. The canonical example is the four-concatenation criterion: the concatenation 0 is bent if and only if
1
2. Dual alignment, homogeneity, and structural regimes
A central refinement is “Condition A,” introduced for even 2 and 3. A vectorial dual-bent 4 satisfies Condition A when
5
for all 6, and all nonzero components 7 are either regular or weakly regular with the same constant 8. For 9, Condition A reduces to the identity alignment above; for odd 0, Proposition 2 states that Condition A forces regularity, so 1 (Wang et al., 2023).
A broader homogeneity regime appears in the codebook and code constructions. Under Condition I in (Heng et al., 29 Jun 2025), one assumes
2
with all components weakly regular and sharing the same sign 3. Condition II keeps the same dual-scaling law and homogeneity but allows the component signs to vary as 4, where 5 is the quadratic character on 6. These two regimes control both exact hybrid character sums and the resulting cross-correlation spectra of codebooks (Heng et al., 29 Jun 2025).
The scalar 7-form viewpoint furnishes another structural characterization. A 8-ary function 9 is an 0-form if 1 for all 2. In the formulation summarized in (Wang et al., 2023), a 3-ary function 4 with 5 is weakly regular vectorial dual-bent if and only if 6 is weakly regular bent of 7-form with 8. This statement explains why homogeneity repeatedly appears in dual-scaling laws and in constructions derived from scalar weakly regular bent functions (Wang et al., 2023).
Maiorana–McFarland families provide the most explicit large classes. In the 9-ary setting, if 0 and
1
then the scalar components have explicit duals involving 2, and these duals can be made to satisfy the 3 property used in secondary constructions. In the Boolean setting, the same class underlies the four-concatenation theory via functions of the form 4 and the 5 property for the permutations 6 (Bapić, 2022, Polujan et al., 2023).
3. Construction methods
One major secondary construction begins with a weakly regular vectorial bent 7 whose dual components satisfy the 8 property. For a linearly independent set 9, the 0-ary 1 condition is
2
and Lemma 1 states that this is equivalent to
3
for all 4. If 5, then the constructed function
6
is again vectorial weakly regular bent, and its scalar duals satisfy
7
(Bapić, 2022). This yields infinite families, especially in 8-ary Maiorana–McFarland form.
A second construction paradigm is Boolean four-concatenation. If 9 are Boolean bent functions, their canonical concatenation is bent exactly when 0. The paper (Polujan et al., 2023) generalizes the known Maiorana–McFarland case 1 to
2
where 3 is arbitrary, and derives an explicit dual condition in terms of the inverses of permutations with the 4 property. The same paper also gives a piecewise lifting from 5-permutations to 6-permutations, thereby producing a recursive dimension-lifting method for new bent families satisfying the dual bent condition.
The Boolean construction is not restricted to completed Maiorana–McFarland equivalence. Under additional hypotheses involving property 7, the absence of linear structures in the components of 8, and 9, the resulting concatenation is bent and outside 00. The same framework yields explicit monomial-permutation constructions and is further adapted to homogeneous cubic bent functions, an area where, as the paper notes, only very few design methods are known (Polujan et al., 2023).
4. Combinatorial correspondences
Vectorial dual-bent functions organize several classical combinatorial objects through their fibers. For 01, let 02. Under the standing assumptions used in the partial-difference-set theory—03 odd, 04, 05, and all nonzero components regular or weakly regular with a common sign 06—the zero fiber 07 is a partial difference set, and so are the preimages of squares, nonsquares, and, more generally, the preimages of cosets 08 of power subgroups whenever the permutation 09 is compatible with the coset structure (Wang et al., 2022). The same paper shows that if 10 is the identity then the preimage of any subset 11 is a partial difference set, and it interprets many earlier constructions from weakly regular 12-ary bent functions as special cases of this vectorial dual-bent framework.
Under Condition A, the correspondence becomes sharper. Proposition 3 of (Wang et al., 2023) states that 13 is vectorial dual-bent with Condition A if and only if every fiber 14 is a regular partial difference set with explicit parameters. Theorem 1 then upgrades these fibers to an amorphic association scheme on 15, with 16 except in the exceptional case 17, 18, 19, where 20. The same paper further characterizes Condition A through two-weight projective codes and generalized Hadamard matrices, and in the binary case it proves that Condition A is equivalent to a bent partition structure (Wang et al., 2023).
Bent partitions provide the converse language in odd characteristic. For 21 odd, Theorem 3 of (Wang et al., 2023) states that a partition 22 of 23 satisfies Condition 24 if and only if the associated map 25 for 26 is a vectorial dual-bent function satisfying Condition A. This correspondence yields an alternative proof that the families 27, obtained from suitable (pre)semifields, are bent partitions. It also gives a sufficient condition for unions of partition blocks to form partial difference sets and, for odd 28, a characterization of such bent partitions entirely in terms of those partial difference sets (Wang et al., 2023).
5. Character sums, codebooks, and linear codes
Hybrid character sums expose the harmonic-analytic content of vectorial dual-bentness. For a multiplicative character 29 of 30, a vectorial dual-bent 31, and 32, consider
33
Under Condition I and 34, Theorem 111 of (Heng et al., 29 Jun 2025) gives
35
so 36. For a general nontrivial 37 of order 38, the same paper expresses 39 through Gaussian sums and a character 40 satisfying 41, and again obtains modulus 42 or 43. Under Condition II the quadratic-character case acquires an explicit 44-scaled Gaussian factor, while the nonquadratic case still yields modulus 45 or 46 (Heng et al., 29 Jun 2025).
These estimates feed directly into codebook constructions. The paper (Heng et al., 29 Jun 2025) derives three families of asymptotically optimal complex codebooks with very small alphabet sizes, and all three families have only two-valued or three-valued cross-correlation amplitudes. The later paper “New families of asymptotically optimal codebooks from vectorial dual-bent functions” constructs several further families that asymptotically achieve the Welch bound; the maximum cross-correlation amplitudes and the distributions of the cross-correlation amplitudes are explicitly determined, the parameter sets are new, and some families have very small alphabet sizes (Wei et al., 29 Jun 2026).
Vectorial dual-bent functions also generate linear codes through trace evaluation on fiber sets. In (Wang et al., 2024), the code
47
is constructed from a vectorial dual-bent 48 and a subset 49 of the codomain. Under Conditions I–III of that paper, the resulting 50-ary codes are self-orthogonal; in various cases they have at most five or six nonzero weights; and their duals furnish at least almost optimal linear complementary dual codes and quantum codes. The same work shows that earlier constructions from weakly regular 51-ary bent functions and from non-degenerate quadratic forms are recovered as special cases (Wang et al., 2024).
6. Explicit families, constraints, and open directions
Several concrete families illustrate the range of the theory. In the 52-ary secondary construction, Example 1 of (Bapić, 2022) takes 53, 54, 55, 56, 57, and 58, producing a weakly regular bent 59-function with explicit component duals. In the Boolean concatenation setting, (Polujan et al., 2023) gives an example with 60, 61, monomial permutations 62, and affine trace terms 63 for which the concatenation 64 is bent and outside 65. The same paper also provides a quadratic inverse-monomial example in 66 whose concatenation is computationally verified to lie outside 67 (Polujan et al., 2023).
The combinatorial side also has explicit small examples. For 68 and 69, the ternary weakly regular bent 70-form 71 has level-set sizes 72, and the induced bent partition does not come from a normal bent partition, answering an open problem posed in earlier bent-partition work (Wang et al., 2023). On the coding side, (Wang et al., 2024) gives, for 73, 74, 75, 76, the self-orthogonal 77 code from 78 with 79, and the 80 code with 81. For codebooks, (Heng et al., 29 Jun 2025) presents a Condition I example with 82, 83, 84, 85, yielding a 86 codebook with 87 (Heng et al., 29 Jun 2025).
The constraints appearing across these papers are rigid and structural. Bentness imposes even 88 in the Boolean case; many vectorial constructions assume 89; Condition A requires even 90 and 91; the hybrid-sum and code constructions use divisibility conditions such as 92, homogeneity constraints 93, and dual-scaling congruences 94 (Wang et al., 2023, Heng et al., 29 Jun 2025). The Boolean 95-based constructions further require permutations whose sums and inverse sums remain permutations, while some non-96 results require 97, property 98, and absence of linear structures (Polujan et al., 2023).
Open problems in the literature are correspondingly specific. (Bapić, 2022) asks for a monomial exponent 99 such that 00 yields a vectorial 01-ary weakly regular bent function whose component duals satisfy 02. (Polujan et al., 2023) asks for sufficient conditions ensuring that the lifted permutations in the recursive 03 construction preserve the property of being outside 04, whether recursive lifting preserves the outside-05 property, and how to broaden the admissible 06 beyond monomial trace choices. (Heng et al., 29 Jun 2025) asks for a classification of vectorial dual-bent functions satisfying Conditions I or II, for extensions of explicit hybrid-sum evaluations to broader mixed-character settings, and for constructions of MWBE codebooks from vectorial dual-bent functions. A plausible implication is that the subject is now less constrained by the existence of isolated examples than by the difficulty of reconciling dual closure, homogeneity, weak regularity, and fiberwise combinatorial regularity within a single explicit family.