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

Abstract

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 d5, over the finite field Fq 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 Fq (Problem Aq,μ×) and for rings ZR of integers modulo R (Problem AR,μ+), where μ is a parameter. In particular, Problem AR,μ+ is as follows: for each element λ of ZR, determine the number of all possible μ-tuples \λ1,λ2,…,λμ\, each of which consists of μ distinct elements λj of ZR such that their sum in ZR is equal to λ. Open Problems Aq,μ× and AR,μ+ 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 R=q-1. To solve Problem AR,μ+, we found a universal method, connected with the values of R and μ, using orbits of elements in ZR and then we solved the problem for many pairs R,μ, obtaining the needed weight distributions for the corresponding pairs q=R+1,d=μ+2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…