A Proof of a Conjecture About a Class of Near Maximum Distance Separable Codes
arXiv:2304.04176
Abstract
In this paper, we completely determine the number of solutions to for all . 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.
15 pages