On Some Exponential Sums Related to the Coulter's Polynomial

Minglong Qi, Shengwu Xiong, Jingling Yuan, Wenbi Rao, Luo ZhongarXiv 2017 · OpenReview

Abstract

In this paper, the formulas of some exponential sums over finite field, related to the Coulter's polynomial, are settled based on the Coulter's theorems on Weil sums, which may have potential application in the construction of linear codes with few weights.

Introduction

In the fields of information theory and cryptography, the construction of efficient linear codes is a primary objective. Linear codes with "few weights"—where codewords possess a limited variety of non-zero element counts—are particularly prized for their applications in secret sharing schemes and consumer electronics. A standard technique for generating these codes is the "defining set method." However, the efficacy of this method relies heavily on the ability to determine the exact cardinality of specific subsets within finite fields.

These cardinalities are typically calculated by evaluating complex exponential sums, known as Weil sums. While foundational evaluations for these sums were established by Robert Coulter in the late 1990s, applying these results to subsets defined by trace functions has remained a significant mathematical challenge. This paper addresses this gap by providing explicit algebraic formulas for exponential sums and set cardinalities related to Coulter’s polynomial, specifically for the case where the ratio of the field extension degree to the polynomial parameter ($e/d$) is odd.

Methodology

The research employs a rigorous analytical approach grounded in number theory and finite field theory. The authors utilize character theory, specifically additive and multiplicative characters, to transform the problem into a manageable algebraic structure.

The work builds directly upon Coulter’s 1998 theorems regarding Weil sums, denoted as $S_\alpha(a, b)$. The authors perform a systematic case analysis based on:

  1. The properties of the prime $p$ (e.g., $p \equiv 1 \pmod 4$ vs. $p \equiv 3 \pmod 4$).
  2. The parity of the field extension degree $e$.
  3. The use of quadratic Gauss sums to simplify the resulting expressions for set cardinalities.

To streamline the complex notation inherent in Weil sums, the authors introduce a constant $\kappa$. This constant encapsulates the behavior of the sum based on the field's characteristics, making the final formulas more accessible for practical application in coding theory.

Key Results

The paper establishes two primary theorems that provide closed-form expressions for set cardinalities, which are essential for calculating the weight distribution of linear codes.

Theorem 3.1: Cardinality of $D_\alpha(a)$

This theorem provides the cardinality $n_\alpha(a)$ for the set: $$D_\alpha(a) = \{x \in \mathbb{F}_q : Tr(x^{p^\alpha+1}) = a\}$$ For instance, the paper demonstrates that if $e$ is odd and $p \equiv 1 \pmod 4$, the size is exactly $p^{e-1} + \eta(a)p^{\frac{e-1}{2}}$.

Theorem 3.2: Cardinality of $M_\alpha(a, c)$

This theorem addresses the more complex set $M_\alpha(a, c)$, which involves simultaneous trace conditions. The evaluation of this set is sensitive to the unique solution $\gamma$ of the equation $x^{p^{2\alpha}} + x = -b^{p^\alpha}$.

Discussion and Applications

The primary contribution of this work is the bridge it builds between abstract exponential sums and the practical requirements of coding theory. By focusing on the condition where $e/d$ is odd—a scenario where Coulter’s polynomial $\mathfrak{C}(x)$ often behaves as a permutation polynomial—the authors provide the "magic numbers" necessary for determining code parameters.

While the paper provides the mathematical foundation, it acknowledges certain limitations. The results are restricted to the $e/d$ odd case, leaving a unified theory for all cases as an open problem. Furthermore, while the potential for constructing linear codes with few weights is clear, the paper does not provide specific code implementations or error-correction performance bounds. Future work may involve the practical implementation of these results and the efficient calculation of the solution $\gamma$ required for Theorem 3.2.

Summary updated

Abstract

In this paper, the formulas of some exponential sums over finite field, related to the Coulter's polynomial, are settled based on the Coulter's theorems on Weil sums, which may have potential application in the construction of linear codes with few weights.
BibTeX
@misc{qi2017some,
  author = {Minglong Qi and Shengwu Xiong and Jingling Yuan and Wenbi Rao and Luo Zhong},
  title = {{On Some Exponential Sums Related to the Coulter's Polynomial}},
  year = {2017},
  eprint = {1707.09708},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1707.09708},
}

Loading related content...

Figure