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

01/22/2019
by   Shudi Yang, et al.
0

We construct a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. The results show that they are at most three-weight codes and they are suitable for applications in secret sharing schemes. We give an extension of the results raised by Wang et al.(2017).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2020

Weight hierarchies and weight distributions of two families of p-ary linear codes

By choosing proper defining sets from inhomogeneous quadratic functions ...
research
12/09/2020

Complete weight enumerators of a class of linear codes with four or five weights

In this paper, based on the theory of defining sets, a class of four-wei...
research
12/11/2021

The construction for several few-weight linear codes and their applications

In this paper, for any odd prime p and an integer m≥ 3, several classes ...
research
05/13/2022

A class of few-Lee weight ℤ_2[u]-linear codes using simplicial complexes and minimal codes via Gray map

Recently some mixed alphabet rings are involved in constructing few-Lee ...
research
06/13/2023

Weight hierarchies of 3-weight linear codes from two p-ary quadratic functions

The weight hierarchy of a linear code has been an important research top...
research
12/22/2021

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

In this paper we consider two pointsets in PG(2,q^n) arising from a line...
research
02/24/2018

Linear codes with few weights over F_2+uF_2

In this paper, we construct an infinite family of five-weight codes from...

Please sign up or login with your details

Forgot password? Click here to reset