DeepAI AI Chat
Log In Sign Up

Two pointsets in PG(2,q^n) and the associated codes

by   Vito Napolitano, et al.
Università degli Studi della Campania "Luigi Vanvitelli"

In this paper we consider two pointsets in PG(2,q^n) arising from a linear set L of rank n contained in a line of PG(2,q^n): the first one is a linear blocking set of Rédei type, the second one extends the construction of translation KM-arcs. We point out that their intersections pattern with lines is related to the weight distribution of the considered linear set L. We then consider the Hamming metric codes associated with both these constructions, for which we can completely describe their weight distributions. By choosing L to be an 𝔽_q-linear set with a short weight distribution, then the associated codes have few weights. We conclude the paper by providing a connection between the ΓL-class of L and the number of inequivalent codes we can construct starting from it.


page 1

page 2

page 3

page 4


New MRD codes from linear cutting blocking sets

Minimal rank-metric codes or, equivalently, linear cutting blocking sets...

On the complete weight enumerators of some linear codes with a few weights

Linear codes with a few weights have important applications in authentic...

Complete weight enumerators of a class of linear codes with two or three weights

We construct a class of linear codes by choosing a proper defining set a...

The construction and weight distributions of all projective binary linear codes

Boolean functions can be used to construct binary linear codes in many w...

Binary linear codes with few weights from two-to-one functions

In this paper, we apply two-to-one functions over 𝔽_2^n in two generic c...

Maximum Weight Spectrum Codes

We prove a conjecture recently proposed by Shi, Zhu, Solé and Cohen on l...

Two classes of linear codes with a few weights based on twisted Kloosterman sums

Linear codes with a few weights have wide applications in information se...