Construction of MDS Euclidean Self-Dual Codes via Two Subsets

TL;DR

This paper develops new methods for constructing MDS Euclidean self-dual codes using generalized Reed-Solomon codes and specific evaluation point sets, resulting in several new families of such codes.

Contribution

It introduces novel constructions of MDS Euclidean self-dual codes via evaluation sets involving trace functions, subspaces, cosets, and subgroup intersections, expanding the known code families.

Findings

Four new families of MDS Euclidean self-dual codes constructed.

A lemma for symmetric difference of subsets used to generalize constructions.

Three generic constructions with flexible parameters provided.

Abstract

The parameters of a $q$-ary MDS Euclidean self-dual codes are completely determined by its length and the construction of MDS Euclidean self-dual codes with new length has been widely investigated in recent years. In this paper, we give a further study on the construction of MDS Euclidean self-dual codes via generalized Reed-Solomon (GRS) codes and their extended codes. The main idea of our construction is to choose suitable evaluation points such that the corresponding (extended) GRS codes are Euclidean self-dual. Firstly, we consider the evaluation set consists of two disjoint subsets, one of which is based on the trace function, the other one is a union of a subspace and its cosets. Then four new families of MDS Euclidean self-dual codes are constructed. Secondly, we give a simple but useful lemma to ensure that the symmetric difference of two intersecting subsets of finite fields can be taken as the desired evaluation set. Based on this lemma, we generalize our first construction and provide two new families of MDS Euclidean self-dual codes. Finally, by using two multiplicative subgroups and their cosets which have nonempty intersection, we present three generic constructions of MDS Euclidean self-dual codes with flexible parameters. Several new families of MDS Euclidean self-dual codes are explicitly constructed.