scroll identifier for mobile
main-content

16.03.2019

# Three-weight codes, triple sum sets, and strongly walk regular graphs

Zeitschrift:
Designs, Codes and Cryptography
Autoren:
Minjia Shi, Patrick Solé
Wichtige Hinweise
Communicated by J. H. Koolen.
This research is supported by National Natural Science Foundation of China (61672036), Excellent Youth Foundation of Natural Science Foundation of Anhui Province (1808085J20).

## Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Abstract

We construct strongly walk-regular graphs as coset graphs of the duals of three-weight codes over $$\mathbb {F}_q.$$ The columns of the check matrix of the code form a triple sum set, a natural generalization of partial difference sets. Many infinite families of such graphs are constructed from cyclic codes, Boolean functions, and trace codes over fields and rings. Classification in short code lengths is made for $$q=2,3,4$$.

### Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten

Literatur
Über diesen Artikel