Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912456227422208 |
|---|---|
| author | Heng, Ziling Wang, Peng Li, Chengju |
| author_facet | Heng, Ziling Wang, Peng Li, Chengju |
| contents | Hybrid character sums are an important class of exponential sums which have nice applications in coding theory and sequence design. Let $\gf_{p^m}$ be the finite field with $p^m$ elements for a prime $p$ and a positive integer $m$. Let $V_n^{(p)}$ be an $n$-dimensional vector space over $\gf_p$ for a prime $p$. In this paper, we study the hybrid character sums of the form \begin{eqnarray*} \sum_{x \in V_n^{(p)}}ψ\left(F(x)\right)χ_1\left(a x\right), \end{eqnarray*} where $F$ is a function from $V_n^{(p)}$ to $\gf_{p^m}$ and $a \in V_n^{(p)}$, $ψ$ is a nontrivial multiplicative character of $\gf_{p^m}$ and $χ_1$ is the canonical additive character of $V_n^{(p)}$. If $F(x)$ is a vectorial dual-bent function and $a \in V_n^{(p)}\setminus \{0\}$, we determine their complex modulus or explicit values under certain conditions, which generalizes some known results as special cases. It is concluded that the hybrid character sums from vectorial dual-bent functions have very small complex modulus. As applications, three families of asymptotically optimal complex codebooks are constructed from vectorial dual-bent functions and their maximal cross-correlation amplitude are determined based on the hybrid character sums. The constructed codebooks have very small alphabet sizes, which enhances their appeal for implementation. Besides, all of the three families of codebooks have only two-valued or three-valued cross-correlation amplitudes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_23198 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes Heng, Ziling Wang, Peng Li, Chengju Information Theory Hybrid character sums are an important class of exponential sums which have nice applications in coding theory and sequence design. Let $\gf_{p^m}$ be the finite field with $p^m$ elements for a prime $p$ and a positive integer $m$. Let $V_n^{(p)}$ be an $n$-dimensional vector space over $\gf_p$ for a prime $p$. In this paper, we study the hybrid character sums of the form \begin{eqnarray*} \sum_{x \in V_n^{(p)}}ψ\left(F(x)\right)χ_1\left(a x\right), \end{eqnarray*} where $F$ is a function from $V_n^{(p)}$ to $\gf_{p^m}$ and $a \in V_n^{(p)}$, $ψ$ is a nontrivial multiplicative character of $\gf_{p^m}$ and $χ_1$ is the canonical additive character of $V_n^{(p)}$. If $F(x)$ is a vectorial dual-bent function and $a \in V_n^{(p)}\setminus \{0\}$, we determine their complex modulus or explicit values under certain conditions, which generalizes some known results as special cases. It is concluded that the hybrid character sums from vectorial dual-bent functions have very small complex modulus. As applications, three families of asymptotically optimal complex codebooks are constructed from vectorial dual-bent functions and their maximal cross-correlation amplitude are determined based on the hybrid character sums. The constructed codebooks have very small alphabet sizes, which enhances their appeal for implementation. Besides, all of the three families of codebooks have only two-valued or three-valued cross-correlation amplitudes. |
| title | Hybrid Character Sums From Vectorial Dual-Bent Functions and Asymptotically Optimal Complex Codebooks With Small Alphabet Sizes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2506.23198 |