The [1,0]-twisted generalized Reed-Solomon code

11/08/2022
by   Canze Zhu, et al.
0

In this paper, we not only give the parity check matrix for the [1,0]-twisted generalized Reed-Solomon (in short, TGRS) code, but also determine the weight distribution. Especially, we show that the [1,0]-TGRS code is not GRS or EGRS. Furthermore, we present a sufficient and necessary condition for any punctured code of the [1,0]-TGRS code to be self-orthogonal, and then construct several classes of self-dual or almost self-dual [1,0]-TGRS codes. Finally, basing on these self-dual or almost self-dual [1,0]-TGRS codes, we obtain some LCD [1,0]-TGRS codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2022

The (+)-extended twisted generalized Reed-Solomon code

In this paper, we give a parity check matrix for the (+)-extended twiste...
research
11/23/2021

Self-dual twisted generalized Reed-Solomon codes

In this paper, by using some properties for linear algebra methods, the ...
research
12/12/2021

Multivariate Goppa codes

In this paper, we introduce multivariate Goppa codes, which contain as a...
research
06/12/2023

Fuzzy linear codes based on nested linear codes

In this paper, we describe a correspondence between a fuzzy linear code ...
research
02/19/2020

Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties

In this article, we consider Schubert codes, linear codes associated to ...
research
10/20/2019

Matrix-Product Codes over Commutative Rings and Constructions Arising from (σ,δ)-Codes

A well-known lower bound (over finite fields and some special finite com...
research
01/31/2019

On dual codes in the Doob schemes

The Doob scheme D(m,n'+n") is a metric association scheme defined on E_4...

Please sign up or login with your details

Forgot password? Click here to reset