The Grassl-Rötteler cyclic and consta-cyclic MDS codes are generalised Reed-Solomon codes

12/22/2021
by   Simeon Ball, et al.
0

We prove that the cyclic and constacyclic codes constructed by Grassl and Rötteler in arXiv:1502.05267 are generalised Reed-Solomon codes. This note can be considered as an addendum to that article. It can also be considered as an appendix to arXiv:2106.10180, where Conjecture 11 of arXiv:1502.0526, which was stated for Grassl-Rötteler codes, is proven for generalised Reed-Solomon codes. The content of this note, together with arXiv:2106.10180, therefore implies that Conjecture 11 from arXiv:1502.0526 is true.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/28/2021

A survey on product codes and 2-D codes

One of the simplest way of combining codes to form new codes is to take ...
research
06/18/2019

Asymptotic performance of metacyclic codes

A finite group with a cyclic normal subgroup N such that G/N is cyclic i...
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
01/24/2023

Several families of ternary negacyclic codes and their duals

Constacyclic codes contain cyclic codes as a subclass and have nice alge...
research
03/08/2019

The GC-content of a family of cyclic codes with applications to DNA-codes

Given a prime power q and a positive integer r>1 we say that a cyclic co...
research
05/28/2021

Extended Cyclic Codes Sandwiched Between Reed-Muller Codes

The famous Barnes-Wall lattices can be obtained by applying Construction...
research
10/21/2022

Cyclic codes from low differentially uniform functions

Cyclic codes have many applications in consumer electronics, communicati...

Please sign up or login with your details

Forgot password? Click here to reset