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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Three-weight codes over rings and strongly walk regular graphs
scientific article

    Statements

    Three-weight codes over rings and strongly walk regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 March 2022
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    strongly walk-regular graphs
    0 references
    three-weight codes
    0 references
    homogeneous weight
    0 references
    Kerdock codes
    0 references
    Teichmüller codes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references