Title data
Kiermaier, Michael ; Kurz, Sascha ; Solé, Patrick ; Stoll, Michael ; Wassermann, Alfred:
On strongly walk regular graphs, triple sum sets and their codes.
Bayreuth
,
2020
.  33 p.
DOI: https://doi.org/10.15495/EPub_UBT_00005925
This is the latest version of this item.
Abstract in another language
Strongly walkregular graphs can be constructed as coset graphs of the duals of projective threeweight codes whose weights satisfy a certain equation. We provide classifications of the feasible parameters in the binary and ternary case for medium size code lengths. Additionally some theoretical insights on the properties of the feasible parameters are presented.
Further data
Available Versions of this Item

On strongly walk regular graphs,triple sum sets and their codes. (deposited 12 Dec 2020 22:00)
 On strongly walk regular graphs, triple sum sets and their codes. (deposited 17 Dec 2021 06:58) [Currently Displayed]