ITMar 6

Quasi-twisted codes and their connection with additive constacyclic codes over finite fields

arXiv:2603.06309v1
Predicted impact top 56% in IT · last 90 daysOriginality Synthesis-oriented
AI Analysis

This work addresses theoretical coding theory problems for researchers in algebraic coding, providing incremental advancements in understanding code structures and dualities.

The paper tackles the problem of characterizing quasi-twisted codes and their connection to additive constacyclic codes over finite fields, establishing a one-to-one correspondence and deriving dual relationships, including conditions for self-orthogonality and equivalence in determining duals.

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 $2$. 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 $lm$ with index $l$ over $\mathbb{F}_q$ and additive constacyclic codes of length $m$ over $\mathbb{F}_{q^l}$. 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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes