Abstract
In this paper, we investigate a class of subfield codes of linear codes over the finite field $\mathbb{F}_{p^m}$, where $p$ is an odd prime. We determine the weight distributions of the code $\mathcal{C}_k$ and its punctured version $\bar{\mathcal{C}}_k$, defined via trace functions and the monomial $x^{p^k+1}$. These results generalize previous work on conic codes. Our analysis shows that many of the resulting codes are optimal or almost optimal. Furthermore, the duals of these codes are shown to be optimal with respect to the Sphere Packing bound under specific conditions, particularly for $p > 3$.
Introduction
In coding theory, the construction of linear codes with optimal parameters—maximizing the minimum Hamming distance $d$ for a given length $n$ and dimension $k$—is a fundamental objective. Such codes are vital for ensuring reliability in digital communication and data storage. Beyond finding optimal parameters, determining the complete weight distribution of a code is a significant challenge. The weight distribution provides the frequency of codewords of each possible weight, which is essential for calculating the probability of undetected errors and the error-correction capability of the code.
Subfield codes, which are codes over a base field $\mathbb{F}_p$ derived from codes over an extension field $\mathbb{F}_{p^m}$, have proven to be a fertile ground for discovering high-performing codes. This research focuses on generalizing the construction of "conic codes" to a broader class of functions, specifically investigating the properties of codes defined by the monomial $f(x) = x^{p^k+1}$.
Construction and Methodology
The study defines two primary classes of $p$-ary linear codes. The first, $\mathcal{C}_k$, is defined as:
$$\mathcal{C}_k=\left\{\left(\left( {\rm Tr}_1^m\left(ax^{p^k+1}+bx\right)+c\right)_{x \in \mathbb{F}_{p^m}}, {\rm Tr}_1^m(a)\right) : \, a,b \in \mathbb{F}_{p^m}, c \in \mathbb{F}_p\right\}$$
where ${\rm Tr}_1^m$ is the trace function from $\mathbb{F}_{p^m}$ to $\mathbb{F}_p$. The second class, $\bar{\mathcal{C}}_k$, is a punctured version of $\mathcal{C}_k$ that removes the final coordinate ${\rm Tr}_1^m(a)$.
To determine the weight distributions of these codes, the authors utilized several advanced mathematical techniques:
- Exponential Sums: The weights of codewords were calculated by evaluating Weil sums and Gaussian sums. These sums allow for the counting of zeros of polynomials over finite fields, which corresponds directly to the Hamming weight.
- 2-adic Order Analysis: The weight distributions vary significantly based on the relationship between the extension degree $m$ and the integer $k$. The authors categorized these distributions using the 2-adic order function $v_2(\cdot)$, allowing for a systematic treatment of different field structures.
- Pless Power Moments: These identities were employed to relate the weight distribution of the codes to the parameters of their dual codes, facilitating the proof of optimality for the dual constructions.
Key Insights and Results
Generalization of Conic Codes
Previous literature focused heavily on subfield codes derived from $f(x) = x^2$. By extending this to $f(x) = x^{p^k+1}$, the authors have significantly expanded the family of known subfield codes with predictable and desirable weight distributions.
Optimality and Theoretical Bounds
The research identifies several instances where these codes reach theoretical limits. For example:
- Optimal Duals: For $p > 3$, the duals of $\mathcal{C}_k$ and $\bar{\mathcal{C}}_k$ are optimal with respect to the Sphere Packing bound.
- Ternary Codes: When $p=3$ and $m > 1$, the dual of $\bar{\mathcal{C}}_k$ is an optimal ternary linear code provided $v_2(m) \leq v_2(k)$.
- Specific Examples: The paper highlights a $[126, 7, 95]$ code over $\mathbb{F}_5$ and an $[82, 9, 48]$ code over $\mathbb{F}_3$, both of which possess duals that are optimal.
Structural Sensitivity
A major contribution of this work is the explicit calculation of weight distributions across eight different cases (presented in Tables 1–8 in the original text). These tables provide a roadmap for researchers to determine the exact parameters of these codes for any given $p, m,$ and $k$.
Conclusion
This research provides a rigorous mathematical framework for a new class of $p$-ary linear codes. By generalizing the function class and providing complete weight distributions, the authors have identified several new families of optimal and almost optimal codes. While the study is currently limited to odd primes and specific monomials, it sets the stage for future exploration into more complex linearized polynomials and the potential for similar constructions in characteristic 2 (binary codes).
Summary updated