On the structure of constacyclic codes over finite chain rings

In the present paper, we provide an explicit construction for generators of a $\lambda$-constacyclic code $\mathcal{C}$ of arbitrary length $\mathrm{\ell }$ over a finite chain ring(FCR) $\mathcal{R}$ in terms of certain minimum degree polynomials of the ring $\mathcal{R}[x]\mathrm{/}⟨x^{\mathrm{\ell }}-\lambda ⟩$. Moreover, the proposed construction achieves the minimum possible number of generators. We prove certain properties of this set of generators, using which we obtain a minimal spanning set of $\mathcal{C}$. We also obtain that the rank of $\mathcal{C}$ is $\mathrm{\ell }-n_0$, where $n_0$ is the degree of the minimal degree polynomial in $\mathcal{C}$. Finally, we derive necessary and sufficient conditions under which an arbitrary length $\lambda$-constacyclic code $\mathcal{C}$ over $\mathcal{R}$ is Maximum Hamming Distance with respect to Rank(MHDR) as well as Maximum Distance Separable(MDS) in terms of a torsion code of $\mathcal{C}$ over the residue field ${\mathbb{F}}_q$ of $\mathcal{R}$. We further determine the exact values for $n_0$ for which $\mathcal{C}$ over $\mathcal{R}$ is MHDR.