A Generalization of Cyclic Code Equivalence Algorithm to Constacyclic Codes
Information Theory
2021-08-20 v1 math.IT
Abstract
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.
Cite
@article{arxiv.2108.08619,
title = {A Generalization of Cyclic Code Equivalence Algorithm to Constacyclic Codes},
author = {Dev Akre and Nuh Aydin and Matthew J. Harrington and Saurav Pandey},
journal= {arXiv preprint arXiv:2108.08619},
year = {2021}
}