Quasi-twisted codes and their connection with additive constacyclic codes over finite fields
Kanat Abdukhalikov, Gyanendra K. Verma

TL;DR
This paper investigates quasi-twisted codes over finite fields, establishing their polynomial characterization, duals, and a correspondence with additive constacyclic codes, thereby advancing understanding of their structure and duality properties.
Contribution
It introduces a polynomial-based framework for quasi-twisted codes, explores their duals, and establishes a novel correspondence with additive constacyclic codes over finite fields.
Findings
Polynomial characterization of quasi-twisted codes
Duals of quasi-twisted codes determined
Correspondence between quasi-twisted and additive constacyclic codes established
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Cryptography and Residue Arithmetic
