A Proof of a Conjecture About a Class of Near Maximum Distance Separable Codes

by   Wei Lu, et al.

In this paper, we completely determine the number of solutions to Tr^q^2_q(bx+b)+c=0, x∈μ_q+1\{-1} for all b∈𝔽_q^2, c∈𝔽_q. 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.


page 1

page 2

page 3

page 4

∙ 04/24/2022

Constructions of near MDS codes which are optimal locally recoverable codes

A linear code with parameters [n,k,n-k] is said to be almost maximum dis...
∙ 08/10/2021

Classification of 3 mod 5 arcs in PG(3,5)

The proof of the non-existence of Griesmer [104, 4, 82]_5-codes is just ...
∙ 05/12/2023

New constructions of optimal linear codes from simplicial complexes

In this paper, we construct a large family of projective linear codes ov...
∙ 09/18/2018

Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes

We prove that a class of distance-optimal local reconstruction codes (LR...
∙ 07/24/2018

Symplectic Isometries of Stabilizer Codes

In this paper we study the equivalence of quantum stabilizer codes via s...
∙ 03/20/2023

On new infinite families of completely regular and completely transitive codes

In two previous papers we constructed new families of completely regular...
∙ 06/23/2023

A Proof of the Weak Simplex Conjecture

We solve a long-standing open problem about the optimal codebook structu...

Please sign up or login with your details

Forgot password? Click here to reset