Three-weight codes over rings and strongly walk regular graphs (Q2117518)

There is a well-known interplay between two-weight codes and strongly regular graphs (SRG) via the coset graph of the dual code. Strongly walk-regular graphs (SWRGs) were defined as a generalization of strongly regular graphs. In this paper, the authors generalize the constructions of SWRGs from fields to rings. The rings considered here are \(R=\mathbb{Z}_{p^m}\) and more generally finite chain rings. The weight playing the role of the Hamming in this generalization is the homogeneous weight which can be defined in general over finite Frobenius rings. As an application, it is shown how to construct an infinite family related to Kerdock and generalized Teichmüller codes.