Three-weight codes over rings and strongly walk regular graphs
From MaRDI portal
Publication:2117518
Abstract: We construct strongly walk-regular graphs as coset graphs of the duals of codes with three non-zero homogeneous weights over for a prime, and more generally over chain rings of depth , and with a residue field of size , 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.
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
- 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?)
- A Note on One Weight and Two Weight Projective $\mathbb {Z}_{4}$ -Codes
- 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
- All Reed-Muller codes are linearly representable over the ring of dual numbers over Z/sub 2/
- All \(s\)-sum sets of type 2 or 3 are triple-sum sets
- Canonization of linear codes over \(\mathbb Z_{4}\)
- Codes and rings. Theory and practice
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- 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 ℤpm
- 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
(5)- Some two-weight codes over chain rings and their strongly regular graphs
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- The adjacency codes of the first yellow graphs
- On strongly walk regular graphs, triple sum sets and their codes
- 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)