Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes
Ziling Heng, Peng Wang, Chengju Li

TL;DR
This paper analyzes hybrid character sums derived from vectorial dual-bent functions, determining their properties and applying these results to construct asymptotically optimal complex codebooks with small alphabets and low cross-correlation.
Contribution
It provides explicit evaluations of hybrid character sums for vectorial dual-bent functions and constructs new complex codebooks with optimal correlation properties and small alphabet sizes.
Findings
Hybrid character sums from vectorial dual-bent functions have very small complex modulus.
Constructed codebooks are asymptotically optimal with low cross-correlation.
Codebooks have only two- or three-valued cross-correlation amplitudes.
Abstract
Hybrid character sums are an important class of exponential sums which have nice applications in coding theory and sequence design. Let be the finite field with elements for a prime and a positive integer . Let be an -dimensional vector space over for a prime . In this paper, we study the hybrid character sums of the form \begin{eqnarray*} \sum_{x \in V_n^{(p)}}\psi\left(F(x)\right)\chi_1\left(a x\right), \end{eqnarray*} where is a function from to and , is a nontrivial multiplicative character of and is the canonical additive character of . If is a vectorial dual-bent function and , we determine their complex modulus or explicit values under certain conditions, which generalizes some known results as special cases.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Finite Group Theory Research
