A Proof of a Conjecture About a Class of Near Maximum Distance Separable Codes
Information Theory
2023-04-11 v1 math.IT
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.
Keywords
Cite
@article{arxiv.2304.04176,
title = {A Proof of a Conjecture About a Class of Near Maximum Distance Separable Codes},
author = {Wei Lu and Xia Wu},
journal= {arXiv preprint arXiv:2304.04176},
year = {2023}
}
Comments
15 pages