Linear codes over finite rings are trace codes (Q2185921)

In this paper, the authors give an answer to the question whether all linear codes over a large class of finite rings can be described as trace codes, for a suitable definition of the trace and suitable defining sequences. The trace they employ here is the generalized Frobenius trace (GF-trace). They also give a similar description for the special case of cyclic codes over Galois rings. Important technical tools are the notions of trace dual basis, in the case of linear codes, and of normal basis in the case of cyclic codes.