A Proof of a Conjecture About a Class of Near Maximum Distance Separable Codes
Abstract
In this paper, we completely determine the number of solutions to Trq2q(bx+b)+c=0, x∈ μq+1 \-1\ for all b∈ Fq2, c∈Fq. As an application, we can give the weight distributions of a class of linear codes, and give a completely answer to a recent conjecture about a class of NMDS codes proposed by Heng.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.