ITITMay 11

Weight distributions of cosets of weight 2 of the generalized doubly extended Reed-Solomon codes

arXiv:2605.105948.7
Predicted impact top 62% in IT · last 90 daysOriginality Synthesis-oriented
AI Analysis

For coding theorists, this resolves a known open problem and provides a sufficient condition for Case S, while the new combinatorial problems may enable future progress on Case NS.

The paper solves an open problem on the weight distributions of cosets of weight 2 for generalized doubly extended Reed-Solomon codes, proving that if q-1 and d-2 are coprime then the weight distribution is the same for all such cosets (Case S). It also introduces two new combinatorial problems whose solutions would yield weight distributions for the remaining case (Case NS).

We consider the weight distributions of the cosets of weight 2 of the generalized $[q+1,q+2-d,d]_q$ doubly extended Reed-Solomon codes (GDRS) of minimum distance $d\ge5$, over the finite field $\mathbb{F}_q$ with $q$ elements. For a GDRS code, we say that Case S occurs if the weight distribution for all cosets of weight 2 is the same or otherwise, Case NS occurs. For Case S, the weight distribution is known; however, any sufficient condition for the occurrence of Case S remained an open problem. We prove that if $q-1$ and $d-2$ are coprime then Case S holds, i.e. the problem is solved. Furthermore, we note that in Case S, the GDRS code is 2-regular. Also, we introduce two new open equivalent combinatorial problems for finite fields $\mathbb{F}_q$ (Problem $A_{q,μ}^\times$) and for rings $\mathbb{Z}_\mathfrak{R}$ of integers modulo $\mathfrak{R}$ (Problem $A_{\mathfrak{R},μ}^+$), where $μ$ is a parameter. In particular, Problem $A_{\mathfrak{R},μ}^+$ is as follows: for each element $λ$ of $\mathbb{Z}_\mathfrak{R}$, determine the number of all possible $μ$-tuples $\{λ_1,λ_2,\ldots,λ_μ\}$, each of which consists of $μ$ distinct elements $λ_j$ of $\mathbb{Z}_\mathfrak{R}$ such that their sum in $\mathbb{Z}_\mathfrak{R}$ is equal to $λ$. Open Problems $A_{q,μ}^\times$ and $A_{\mathfrak{R},μ}^+$ are interesting in their own right and, moreover, we proved that their solutions allow us to obtain the weight distributions for Case NS, taking $μ=d-2$ and $\mathfrak{R}=q-1$. To solve Problem $A_{\mathfrak{R},μ}^+$, we found a universal method, connected with the values of $\mathfrak{R}$ and $μ$, using orbits of elements in $\mathbb{Z}_\mathfrak{R}$ and then we solved the problem for many pairs $\mathfrak{R},μ$, obtaining the needed weight distributions for the corresponding pairs $q=\mathfrak{R}+1,d=μ+2$.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes