Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\) (Q606647): Difference between revisions

The paper under review studies constacyclic codes of length \(p^s\) over the ring \({\mathcal R} =\mathbb F_{p^m} + u \mathbb F_{p^m} =\frac {\mathbb F_{p^m}[u]} {\langle u^2\rangle}\) for any prime \(p\). This study is a natural generalization of cyclic codes over \(F_2 + u\mathbb F_2\). Then \(\mathcal R\) is a local ring with maximal ideal \(u {\mathbb F}_{p^m}\). Let \(\alpha\), \(\beta\) be nonzero elements of the field \(\mathbb F_{p^m}\), then \(\alpha + u\beta\) is a unit of \(\mathcal R\). The \(\alpha + u\beta\)-constacyclic codes of length \(p^s\) over \(\mathcal R\) are ideals of the ring \({\mathcal R}_{\alpha,\beta} =\frac{\mathcal R[x]}{\langle x^{p^s}- (\alpha +u\beta)\rangle}\). The author describes the structure and Hamming distances of all \(\alpha + u\beta\)-constacyclic codes of length \(p^s\) over \(\mathcal R\). The author also classifies all cyclic codes of length \(p^s\) over \(\mathcal R\) and gives a one-to-one correspondence between cyclic and \(\tau\)-constacyclic codes of length \(p^s\) over \(\mathcal R\).