Negacyclic self-dual codes over finite chain rings (Q663474): Difference between revisions

The paper under review describes negacyclic self-dual codes of length \(n\) over a finite chain ring \(R\) when the characteristic \(p\) of the residue field and the length \(n\) are relatively prime. This paper is in the direction of the general problem on the construction of codes over rings. The authors generalize the paper [\textit{H. Q. Dinh} and \textit{S. R. López-Permouth}, IEEE Trans. Inf. Theory 50, No. 8, 1728--1744 (2004; Zbl 1243.94043)] using the idea of the paper [\textit{G. H. Norton} and \textit{A. Sălăgean}, IEEE Trans. Inf. Theory 46, No. 3, 1060--1067 (2000; Zbl 0963.94043)]. The authors give necessary and sufficient conditions for the existence of (nontrivial) negacyclic self-dual codes over a finite chain ring. As an application, they construct negacyclic MDR self-dual codes over \(\mathrm{GR}(p^t, m)\) of length \(p^m +1\).