New constructions of optimal linear codes from simplicial complexes

by   Zhao Hu, et al.

In this paper, we construct a large family of projective linear codes over 𝔽_q from the general simplicial complexes of 𝔽_q^m via the defining-set construction, which generalizes the results of [IEEE Trans. Inf. Theory 66(11):6762-6773, 2020]. The parameters and weight distribution of this class of codes are completely determined. By using the Griesmer bound, we give a necessary and sufficient condition such that the codes are Griesmer codes and a sufficient condition such that the codes are distance-optimal. For a special case, we also present a necessary and sufficient condition for the codes to be near Griesmer codes. Moreover, by discussing the cases of simplicial complexes with one, two and three maximal elements respectively, the parameters and weight distributions of the codes are given more explicitly, which shows that the codes are at most 2-weight, 5-weight and 19-weight respectively. By studying the optimality of the codes for the three cases in detail, many infinite families of optimal linear codes with few weights over 𝔽_q are obtained, including Griesmer codes, near Griesmer codes and distance-optimal codes.


page 1

page 2

page 3

page 4


A general family of Plotkin-optimal two-weight codes over ℤ_4

We obtained all possible parameters of Plotkin-optimal two-Lee weight pr...

A subfield-based construction of optimal linear codes over finite fields

In this paper, we construct four families of linear codes over finite fi...

Weight Distributions of Two Classes of Linear Codes with Five or Six Weights

In this paper, based on the theory of defining sets, two classes of five...

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

In this paper, we completely determine the number of solutions to Tr^q^2...

Improved Singleton bound on insertion-deletion codes and optimal constructions

Insertion-deletion codes (insdel codes for short) play an important role...

Linear Codes from Simplicial Complexes over 𝔽_2^n

In this article we mainly study linear codes over 𝔽_2^n and their binary...

Characterisation of the parameters of maximum weight spectrum codes according to their spread

We introduce the concept of spread of a code, and we specialize it to th...

Please sign up or login with your details

Forgot password? Click here to reset