URN to cite this document: urn:nbn:de:bvb:703epub59250
Title data
Kiermaier, Michael ; Kurz, Sascha ; Solé, Patrick ; Stoll, Michael ; Wassermann, Alfred:
On strongly walk regular graphs,triple sum sets and their codes.
Bayreuth
,
2021
.  42 S.
This is the latest version of this item.


Download (384kB)

Abstract
Strongly walkregular graphs (SWRGs) 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 of these codes in the binary and ternary case for medium size code lengths. For the binary case, the divisibility of the weights of these codes is investigated and several general results are shown.
Further data
Available Versions of this Item

On strongly walk regular graphs,triple sum sets and their codes. (deposited 11 Dec 2020 08:47)
 On strongly walk regular graphs,triple sum sets and their codes. (deposited 17 Dec 2021 06:51) [Currently Displayed]