A Generalization of Cyclic Code Equivalence Algorithm to Constacyclic Codes

DOI10.1007/S10623-022-01124-1MaRDI QIDQ6375576arXivWikidataFDO

Authors Dev Akre, Nuh Aydin, Matthew J. Harrington, Saurav R. Pandey

Publication date 19 August 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10623-022-01124-1

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

arXiv classification

cs.ITmath.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.

This page was built for publication: A Generalization of Cyclic Code Equivalence Algorithm to Constacyclic Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375576)