Characterizations and properties of principal $(f, σ, δ)$-codes over rings
Let $A$ be a ring with identity, $σ$ a ring endomorphism of $A$ that maps the identity to itself, $δ$ a $σ$-derivation of $A$, and consider the skew-polynomial ring $A[X;σ,δ]$. When $A$ is a finite field, a Galois ring, or a general ring, some fairly recent literature used $A[X;σ,δ]$ to construct new interesting codes (e.g. skew-cyclic and skew-constacyclic codes) that generalize their classical counterparts over finite fields (e.g. cyclic and constacyclic linear codes). This paper presents results concerning {\it principal} $(f, σ, δ)$-codes over a ring $A$, where $f\in A[X;σ,δ]$ is monic. We provide recursive formulas that compute the entries of both a generating matrix and a control matrix of such a code $\mathcal{C}$. When $A$ is a finite commutative ring with identity and $σ$ is a ring automorphism of $A$, we also give recursive formulas for the entries of a parity-check matrix of $\mathcal{C}$. Also in this case, with $δ=0$, we give a generating matrix of the dual $\mathcal{C}^\perp$, present a characterization of principal $σ$-codes whose duals are also principal $σ$-codes, and deduce a characterization of self-dual principal $σ$-codes. Some corollaries concerning principal $σ$-constacyclic codes are also given, and some highlighting examples are provided.