Quasi-twisted codes and their connection with additive constacyclic codes over finite fields
Abstract
In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to quasi-cyclic codes and determine Euclidean, Hermitian, and symplectic duals of quasi-twisted codes with index . Additionally, we provide necessary and sufficient conditions for the self-orthogonality of appropriate quasi-twisted codes. Next, we explore a one-to-one correspondence between quasi-twisted codes of length with index over and additive constacyclic codes of length over . We establish relationships between trace inner products in the additive setting and Euclidean, symplectic inner products in the quasi-twisted setting. Using these relations and the correspondence, we determine the dual of additive constacyclic codes with respect to the trace inner products. As a consequence, we conclude that determining the trace Euclidean dual and trace Hermitian dual of an additive constacyclic code is equivalent to determining the Euclidean and symplectic dual of the corresponding quasi-twisted code.
Keywords
Cite
@article{arxiv.2603.06309,
title = {Quasi-twisted codes and their connection with additive constacyclic codes over finite fields},
author = {Kanat Abdukhalikov and Gyanendra K. Verma},
journal= {arXiv preprint arXiv:2603.06309},
year = {2026}
}