A note on small weight codewords of projective geometric codes and on the smallest sets of even type

02/09/2023
by   Sam Adriaensen, et al.
0

In this paper, we study the codes 𝒞_k(n,q) arising from the incidence of points and k-spaces in PG(n,q) over the field 𝔽_p, with q = p^h, p prime. We classify all codewords of minimum weight of the dual code 𝒞_k(n,q)^⊥ in case q ∈{4,8}. This is equivalent to classifying the smallest sets of even type in PG(n,q) for q ∈{4,8}. We also provide shorter proofs for some already known results, namely of the best known lower bound on the minimum weight of 𝒞_k(n,q)^⊥ for general values of q, and of the classification of all codewords of 𝒞_n-1(n,q) of weight up to 2q^n-1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2019

New doubly even self-dual codes having minimum weight 20

In this note, we construct new doubly even self-dual codes having minimu...
research
04/06/2018

Singly even self-dual codes of length 24k+10 and minimum weight 4k+2

Currently, the existence of an extremal singly even self-dual code of le...
research
04/08/2021

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...
research
09/17/2019

On the weights of dual codes arising from the GK curve

In this paper we investigate some dual algebraic-geometric codes associa...
research
10/23/2020

Relative projective group codes over chain rings

A structure theorem of the group codes which are relative projective for...
research
01/05/2023

Improved Gilbert-Varshamov bounds for hopping cyclic codes and optical orthogonal codes

Hopping cyclic codes (HCCs) are (non-linear) cyclic codes with the addit...
research
02/02/2023

Certain Diagonal Equations and Conflict-Avoiding Codes of Prime Lengths

We study the construction of optimal conflict-avoiding codes (CAC) from ...

Please sign up or login with your details

Forgot password? Click here to reset