Constructions of self-dual codes over finite commutative chain rings (Q622779): Difference between revisions

Summary: We study self-dual codes over chain rings. We describe a technique for constructing new self-dual codes from existing codes and we prove that for chain rings containing an element \(c\) with \(c^{2} = - 1\), all self-dual codes can be constructed by this technique. We extend this construction to self-dual codes over principal ideal rings via the Chinese Remainder Theorem. We use torsion codes to describe the structure of self-dual codes over chain rings and to set bounds on their minimum Hamming weight. Interestingly, we find the first examples of MDS self-dual codes of lengths 6 and 8 and near-MDS self-dual codes of length 10 over a certain chain ring which is not a Galois ring.