Several classes of two-weight and three-weight linear codes

11/10/2019
by   Dabin Zheng, et al.
0

Linear codes with few weights have been widely studied due to their applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, we further construct several classes of new two-weight and three-weight linear codes from defining sets and determine their weight distributions by applications of the theory of quadratic forms and Weil sums over finite fields. Some of the linear codes obtained are optimal or almost optimal with respect to the Griesmer bound. This paper generalizes some results in <cit.>.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2021

Two new classes of projective two-weight linear codes

In this paper, for an odd prime p, several classes of two-weight linear ...
research
11/23/2018

A class of linear codes with few weights

Linear codes have been an interesting topic in both theory and practice ...
research
06/17/2020

Binary linear codes with few weights from Boolean functions

Boolean functions have very nice applications in cryptography and coding...
research
02/17/2020

Codes with few weights arising from linear sets

In this article we present a class of codes with few weights arising fro...
research
11/08/2022

Several classes of projective few-weight linear codes and their applications

It is well-known that few-weight linear codes have better applications i...
research
05/15/2023

Characterization of Plotkin-optimal two-weight codes over finite chain rings and related applications

Few-weight codes over finite chain rings are associated with combinatori...
research
03/12/2018

Quadratic and symmetric bilinear forms over finite fields and their association schemes

Let Q(m,q) and S(m,q) be the sets of quadratic forms and symmetric bilin...

Please sign up or login with your details

Forgot password? Click here to reset