Euclidean self-dual codes over non-commutative Frobenius rings (Q300875): Difference between revisions

For a finite ring \(R\), the standard inner product on \(R^n\) is considered. The authors then define for a code \(C \subseteq R^n\) the left dual code and the right dual code as the corresponding annihilators. If a code equals its left dual it also equals its right dual, and in this case the code is called self-dual. The paper contains several results and illustrative examples on this matter. In particular, self-dual codes of length one over Frobenius rings and over chain rings are considered. An emphasis is given to various constructions of self-dual codes. For example, if \(R\) is Frobenius and satisfies \(\alpha^2 = -1\) for a central element \(\alpha\) (resp. \(\alpha^2 + \beta^2 = -1\) for central \(\alpha\) and \(\beta\)), then free self-dual codes exist for all even lengths (resp. all lengths divisible by four). Also given are constructions of self-dual codes based on given self-dual codes in the center of the ring. Moreover, constructions are provided which under certain assumptions build up codes of length \(n + 2\) or \(n + 4\) from a code of length \(n\). A few remarks on the case when the ring is symmetric Frobenius are finally given.