A Generalization of Cyclic Code Equivalence Algorithm to Constacyclic Codes

08/19/2021
by   Dev Akre, et al.
0

Recently, a new algorithm to test equivalence of two cyclic codes has been introduced which is efficient and produced useful results. In this work, we generalize this algorithm to constacyclic codes. As an application of the algorithm we found many constacyclic codes with good parameters and properties. In particular, we found 23 new codes that improve the minimum distances of BKLCs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2021

A New Algorithm for Equivalence of Cyclic Codes and Its Applications

Cyclic codes are among the most important families of codes in coding th...
research
06/22/2021

Polycyclic Codes Associated with Trinomials: Good Codes and Open Questions

Polycyclic codes are a generalization of cyclic and constacyclic codes. ...
research
02/04/2022

About Code Equivalence – a Geometric Approach

The equivalence test is a main part in any classification problem. It he...
research
11/02/2022

On the equivalence of linear cyclic and constacyclic codes

We introduce new sufficient conditions for permutation and monomial equi...
research
08/20/2021

A Generalization of the ASR Search Algorithm to 2-Generator Quasi-Twisted Codes

One of the main goals of coding theory is to construct codes with best p...
research
03/30/2023

Constructions and equivalence of Sidon spaces

Sidon spaces have been introduced by Bachoc, Serra and Zémor in 2017 as ...
research
09/21/2023

A quaternary analogue of Tang-Ding codes

In a recent paper, Tang and Ding introduced a class of binary cyclic cod...

Please sign up or login with your details

Forgot password? Click here to reset