Three-weight codes over rings and strongly walk regular graphs

DOI10.1007/S00373-021-02430-6MaRDI QIDQ2117518zbMATH OpenOpenAlexWikidataFDO

Authors Minjia Shi, Michael Kiermaier, Sascha Kurz, Patrick Solé

Publication date 21 March 2022

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1912.03892

zbMATH Keywords

homogeneous weightKerdock codesstrongly walk-regular graphsTeichmüller codesthree-weight codes

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Theory of error-correcting codes and error-detecting codes (94B99)

Abstract: We construct strongly walk-regular graphs as coset graphs of the duals of codes with three non-zero homogeneous weights over $mathbb{Z}_{p^m},$ for $p$ a prime, and more generally over chain rings of depth $m$, and with a residue field of size $q$, a prime power. Infinite families of examples are built from Kerdock and generalized Teichm"uller codes. As a byproduct, we give an alternative proof that the Kerdock code is nonlinear.

Review text

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.

Recommendations

• Three-weight codes, triple sum sets, and strongly walk regular graphs
• Binary codes of strongly regular graphs
• On strongly walk regular graphs, triple sum sets and their codes
• scientific article; zbMATH DE number 5610748
• Using two connected vehicles to measure the frequencies of bridges with rough surface: a theoretical study

Cites work

• A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb F_p[u]/\langle u^m\rangle\)
• A metric for codes over residue class rings
• A Note on One Weight and Two Weight Projective $\mathbb {Z}_{4}$ -Codes
• All \(s\)-sum sets of type 2 or 3 are triple-sum sets
• All Reed-Muller codes are linearly representable over the ring of dual numbers over Z/sub 2/
• Canonization of linear codes over \(\mathbb Z_{4}\)
• Codes and rings. Theory and practice
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• scientific article; zbMATH DE number 4016770 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1461530 (Why is no real title available?)
• scientific article; zbMATH DE number 4114551 (Why is no real title available?)
• scientific article; zbMATH DE number 2114370 (Why is no real title available?)
• New ring-linear codes from dualization in projective Hjelmslev geometries
• Nonlinear codes defined by quadratic forms over GF(2)
• On $Z_{2^k}$-Dual Binary Codes
• On triple-sum-sets and two or three weights codes
• Optimal binary codes from one-Lee weight codes and two-Lee weight projective codes over \(\mathbb Z_4\)
• Power moment identities on weight distributions in error correcting codes
• Properties of codes with two homogeneous weights
• Ring geometries, two-weight codes, and strongly regular graphs
• Spectra of graphs
• Strongly walk-regular graphs
• The Geometry of Two-Weight Codes
• The Geometry of Two-Weight Codes Over ℤ_p^m
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Three-weight codes, triple sum sets, and strongly walk regular graphs
• Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
• Weighted modules and representations of codes
• Weights of linear codes and strongly regular normed spaces

Cited in

(9)

• On the coset graph construction of distance-regular graphs
• Three-weight codes, triple sum sets, and strongly walk regular graphs
• On strongly walk regular graphs, triple sum sets and their codes
• Some two-weight codes over chain rings and their strongly regular graphs
• The adjacency codes of the first yellow graphs
• Linear codes over \(\mathbb{Z}_{p^2}\) with few-weight from down-sets
• Two families of strongly walk regular graphs from three-weight codes over \(\mathbb{Z}_4 \)
• Constructing optimal few weight quaternary linear codes via multivariable functions
• Ramanujan graphs from simplicial complexes with few blockers

This page was built for publication: Three-weight codes over rings and strongly walk regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117518)