An efficient method to construct self-dual cyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} \) (Q2174606)

A code \(C\) over a ring is self-dual if \(C=C^\perp\), where \(C^\perp\) is the standard Euclidean dual. The code \(C\) is cyclic if \((c_0,c_1,\ldots,c_{n-1}) \in C\) implies \((c_{n-1}, c_0,c_1,\ldots,c_{n-2})\). The authors use combinatorial techniques to give an explicit representation and enumeration for all distinct self-dual cyclic codes of length \(p^s\) over the ring \(F_{p^m} [u] / \langle u^2 \rangle\). Additionally, they given an efficient method to construct every self-dual cyclic code in this setting.