The Subfield Codes of [q+1, 2, q] MDS Codes

08/03/2020
by   Ziling Heng, et al.
0

Recently, subfield codes of geometric codes over large finite fields (q) with dimension 3 and 4 were studied and distance-optimal subfield codes over (p) were obtained, where q=p^m. The key idea for obtaining very good subfield codes over small fields is to choose very good linear codes over an extension field with small dimension. This paper first presents a general construction of [q+1, 2, q] MDS codes over (q), and then studies the subfield codes over (p) of some of the [q+1, 2,q] MDS codes over (q). Two families of dimension-optimal codes over (p) are obtained, and several families of nearly optimal codes over (p) are produced. Several open problems are also proposed in this paper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2022

Two classes of subfield codes of linear codes

Recently, subfiled codes of linear code over GF(q) with good parameters ...
research
06/15/2021

The subfield codes and subfield subcodes of a family of MDS codes

Maximum distance separable (MDS) codes are very important in both theory...
research
07/09/2022

The construction of MDS self-dual codes from generalized Reed-Solomon codes

MDS codes and self-dual codes are important families of classical codes ...
research
08/18/2022

Near-MDS Codes from Maximal Arcs in PG(2,q)

The singleton defect of an [n,k,d] linear code C is defined as s( C)=n-k...
research
07/18/2023

Subfield subcodes of projective Reed-Muller codes

Explicit bases for the subfield subcodes of projective Reed-Muller codes...
research
09/04/2018

Adelic Extension Classes, Atiyah Bundles and Non-Commutative Codes

This paper consists of three components. In the first, we give an adelic...
research
07/14/2021

Twisted Reed-Solomon Codes

In this article, we present a new construction of evaluation codes in th...

Please sign up or login with your details

Forgot password? Click here to reset