Three-weight codes over rings and strongly walk regular graphs

DOI10.1007/S00373-021-02430-6zbMATH Open1493.94055arXiv1912.03892OpenAlexW2992665256WikidataQ122781711 ScholiaQ122781711MaRDI QIDQ2117518FDOQ2117518

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

Publication date: 21 March 2022

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

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.

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

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
• Using two connected vehicles to measure the frequencies of bridges with rough surface: a theoretical study

zbMATH Keywords

homogeneous weightKerdock codesthree-weight codesstrongly walk-regular graphs[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Teichm%EF%BF%BD%EF%BF%BDller+codes&go=Go Teichm��ller 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)

Cites Work

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

Cited In (4)

• On strongly walk regular graphs, triple sum sets and their codes
• Three-weight codes, triple sum sets, and strongly walk regular graphs
• The adjacency codes of the first yellow graphs
• On the coset graph construction of distance-regular graphs

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)