Few-weight codes over F_p+u F_p associated with down sets and their distance optimal Gray image

10/17/2019
by   Yansheng Wu, et al.
0

Let p be an odd prime number. In this paper, we construct 2(2p-3) classes of codes over the ring R= F_p+u F_p,u^2=0, which are associated with down-sets. We compute the Lee weight distributions of the 2(2p-3) classes of codes when the down-sets are generated by a single maximal element. Moreover, by using the Gray map of the linear codes over R, we find out 2(p-1) classes of p-ary distance optimal linear codes. Two classes of them are attained the Griesmer bound with equality as well.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2019

Optimal few-weight codes from simplicial complexes

Recently, some infinite families of binary minimal and optimal linear co...
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
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
03/22/2022

Weight distributions of two classes of linear codes based on Gaussian period and Weil sums

In this paper, based on the theory of defining sets, two classes of at m...
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
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
02/05/2020

Pure Resolutions, Linear Codes, and Betti Numbers

We consider the minimal free resolution of Stanley-Reisner rings associa...

Please sign up or login with your details

Forgot password? Click here to reset