{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T17:31:18Z","timestamp":1782322278742,"version":"3.54.5"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e4t Bayreuth"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,2]]},"abstract":"Abstract<\/jats:title>Strongly walk regular graphs (SWRGs or s<\/jats:italic>-SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length\u00a02 are replaced by paths of length\u00a0s<\/jats:italic>. They can be constructed as coset graphs of the duals of projective three-weight 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. It is known that an s<\/jats:italic>-SWRG has at most 4 distinct eigenvalues $$k> \\theta _1> \\theta _2 > \\theta _3$$<\/jats:tex-math>\n \n k<\/mml:mi>\n ><\/mml:mo>\n \n \u03b8<\/mml:mi>\n 1<\/mml:mn>\n <\/mml:msub>\n ><\/mml:mo>\n \n \u03b8<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n ><\/mml:mo>\n \n \u03b8<\/mml:mi>\n 3<\/mml:mn>\n <\/mml:msub>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and that the triple $$(\\theta _1, \\theta _2, \\theta _3)$$<\/jats:tex-math>\n \n (<\/mml:mo>\n \n \u03b8<\/mml:mi>\n 1<\/mml:mn>\n <\/mml:msub>\n ,<\/mml:mo>\n \n \u03b8<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n ,<\/mml:mo>\n \n \u03b8<\/mml:mi>\n 3<\/mml:mn>\n <\/mml:msub>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> satisfies a certain homogeneous polynomial equation of degree $$s - 2$$<\/jats:tex-math>\n \n s<\/mml:mi>\n -<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> (Van Dam, Omidi, 2013). This equation defines a plane algebraic curve; we use methods from algorithmic arithmetic geometry to show that for $$s = 5$$<\/jats:tex-math>\n \n s<\/mml:mi>\n =<\/mml:mo>\n 5<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and $$s = 7$$<\/jats:tex-math>\n \n s<\/mml:mi>\n =<\/mml:mo>\n 7<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, there are only the obvious solutions, and we conjecture this to remain true for all (odd) $$s \\ge 9$$<\/jats:tex-math>\n \n s<\/mml:mi>\n \u2265<\/mml:mo>\n 9<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s10623-022-01118-z","type":"journal-article","created":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T12:03:01Z","timestamp":1668513781000},"page":"645-675","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On strongly walk regular graphs, triple sum sets and their codes"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5901-4381","authenticated-orcid":false,"given":"Michael","family":"Kiermaier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sascha","family":"Kurz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Sol\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Stoll","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfred","family":"Wassermann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,15]]},"reference":[{"issue":"1","key":"1118_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/jlms\/jdr054","volume":"86","author":"K Betsumiya","year":"2012","unstructured":"Betsumiya K., Munemasa A.: On triply even binary codes. J. Lond. Math. Soc. 86(1), 1\u201316 (2012).","journal-title":"J. Lond. Math. Soc."},{"key":"1118_CR2","first-page":"181","volume":"18","author":"A Bonisoli","year":"1984","unstructured":"Bonisoli A.: Every equidistant linear code is a sequence of dual Hamming codes. Ars Comb. 18, 181\u2013186 (1984).","journal-title":"Ars Comb."},{"key":"1118_CR3","doi-asserted-by":"crossref","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3\u20134), 235\u2013265 (1997).","DOI":"10.1006\/jsco.1996.0125"},{"issue":"12","key":"1118_CR4","doi-asserted-by":"publisher","first-page":"7807","DOI":"10.1109\/TIT.2021.3114280","volume":"67","author":"Iliya Bouyukliev","year":"2021","unstructured":"Bouyukliev Iliya, Bouyuklieva Stefka, Kurz Sascha: Computer classification of linear codes. IEEE Trans. Inf. Theory 67(12), 7807\u20137814 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1118_CR5","doi-asserted-by":"publisher","first-page":"4247","DOI":"10.1109\/TIT.2005.859291","volume":"51","author":"M Braun","year":"2005","unstructured":"Braun M., Kohnert A., Wassermann A.: Optimal linear codes from matrix groups. IEEE Trans. Inf. Theory 51(12), 4247\u20134251 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1118_CR6","unstructured":"Brouwer A.E.: Parameters of strongly regular graphs. https:\/\/www.win.tue.nl\/~aeb\/graphs\/srg\/srgtab.html."},{"key":"1118_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"AE Brouwer","year":"1989","unstructured":"Brouwer A.E., Cohen A.M., Neumaier A.: Distance-Regular Graphs. Springer-Verlag, Berlin (1989)."},{"key":"1118_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1939-6","volume-title":"Spectra of Graphs","author":"AE Brouwer","year":"2012","unstructured":"Brouwer A.E., Haemers W.H.: Spectra of Graphs. Springer Science & Business Media, Berlin (2012)."},{"key":"1118_CR9","first-page":"e6","volume":"4","author":"N Bruin","year":"2016","unstructured":"Bruin N., Poonen B., Stoll M.: Generalized explicit descent and its application to curves of genus 3. Forum of mathematics. Sigma 4, e6 (2016).","journal-title":"Sigma"},{"key":"1118_CR10","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1112\/S1461157009000187","volume":"13","author":"N Bruin","year":"2010","unstructured":"Bruin N., Stoll M.: The Mordell-Weil sieve: proving non-existence of rational points on curves. LMS J. Comput. Math. 13, 272\u2013306 (2010).","journal-title":"LMS J. Comput. Math."},{"issue":"2","key":"1118_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1112\/blms\/18.2.97","volume":"18","author":"R Calderbank","year":"1986","unstructured":"Calderbank R., Kantor W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18(2), 97\u2013122 (1986).","journal-title":"Bull. Lond. Math. Soc."},{"key":"1118_CR12","unstructured":"Chen E.: Two-weight codes. http:\/\/moodle.tec.hkr.se\/~chen\/research\/2-weight-codes."},{"issue":"2\u20133","key":"1118_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(84)90047-5","volume":"50","author":"B Courteau","year":"1984","unstructured":"Courteau B., Wolfmann J.: On triple-sum-sets and two or three weights codes. Discrete Math. 50(2\u20133), 179\u2013191 (1984).","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"1118_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(72)90024-6","volume":"3","author":"Ph Delsarte","year":"1972","unstructured":"Delsarte Ph.: Weights of linear codes and strongly regular normed spaces. Discrete Math. 3(1\u20133), 47\u201364 (1972).","journal-title":"Discrete Math."},{"issue":"7","key":"1118_CR15","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1109\/18.796403","volume":"45","author":"S Dodunekov","year":"1999","unstructured":"Dodunekov S., Guritman S., Simonis J.: Some new results on the minimum length of binary linear codes of dimension nine. IEEE Trans. Inf. Theory 45(7), 2543\u20132546 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1118_CR16","doi-asserted-by":"crossref","unstructured":"Dodunekov S., Simonis J.: Codes and projective multisets. Electron. J. Comb. 5, #R37 (1998).","DOI":"10.37236\/1375"},{"key":"1118_CR17","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes (2007). http:\/\/www.codetables.de."},{"key":"1118_CR18","unstructured":"Heinlein D., Honold T., Kiermaier M., Kurz S., Wassermann A.: Projective divisible binary codes. The Tenth International Workshop on Coding and Cryptography 2017 : WCC Proceedings, Saint-Petersburg (2017)."},{"issue":"1","key":"1118_CR19","first-page":"151","volume":"6","author":"DB Jaffe","year":"1997","unstructured":"Jaffe D.B., Ruberman D.: A sextic surface cannot have $$66$$ nodes. J. Algebraic Geom. 6(1), 151\u2013168 (1997).","journal-title":"J. Algebraic Geom."},{"key":"1118_CR20","unstructured":"Kiermaier M., Kurz S.: Classification of $$\\Delta $$-divisible linear codes spanned by codewords of weight $$\\Delta $$, arXiv preprint arXiv:2011.05872 (2021)."},{"issue":"11","key":"1118_CR21","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1016\/j.dam.2007.03.006","volume":"155","author":"A Kohnert","year":"2007","unstructured":"Kohnert A.: Constructing two-weight codes with prescribed groups of automorphisms. Discrete Appl. Math. 155(11), 1451\u20131457 (2007).","journal-title":"Discrete Appl. Math."},{"key":"1118_CR22","unstructured":"Kurz S.: Classification of 8-divisible binary linear codes with minimum distance 24, arXiv preprint arXiv:2012.06163 (2020)."},{"issue":"4","key":"1118_CR23","first-page":"355","volume":"1","author":"X Liu","year":"2010","unstructured":"Liu X.: Binary divisible codes of maximum dimension. Int. J. Inf. Coding Theory 1(4), 355\u2013370 (2010).","journal-title":"Int. J. Inf. Coding Theory"},{"issue":"1","key":"1118_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/j.1538-7305.1963.tb04003.x","volume":"42","author":"J MacWilliams","year":"1963","unstructured":"MacWilliams J.: A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J. 42(1), 79\u201394 (1963).","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"1118_CR25","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0019-9958(63)90189-X","volume":"6","author":"V Pless","year":"1963","unstructured":"Pless V.: Power moment identities on weight distributions in error correcting codes. Inf. Control 6(2), 147\u2013152 (1963).","journal-title":"Inf. Control"},{"key":"1118_CR26","doi-asserted-by":"crossref","unstructured":"Shi M., Kiermaier M., Kurz, S., Sol\u00e9, P.: Three-weight codes over rings and strongly walk regular graphs. Graphs Combin. 38(3), 23 (2022)","DOI":"10.1007\/s00373-021-02430-6"},{"issue":"10","key":"1118_CR27","doi-asserted-by":"publisher","first-page":"2395","DOI":"10.1007\/s10623-019-00628-7","volume":"87","author":"M Shi","year":"2019","unstructured":"Shi M., Sol\u00e9 P.: Three-weight codes, triple sum sets, and strongly walk regular graphs. Des. Codes Cryptogr. 87(10), 2395\u20132404 (2019).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1118_CR28","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/18.272480","volume":"40","author":"J Simonis","year":"1994","unstructured":"Simonis J.: Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed\u2013Muller codes. IEEE Trans. Inf. Theory 40(1), 194\u2013196 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1118_CR29","doi-asserted-by":"publisher","first-page":"245","DOI":"10.4064\/aa98-3-4","volume":"98","author":"M Stoll","year":"2001","unstructured":"Stoll M.: Implementing 2-descent for Jacobians of hyperelliptic curves. Acta Arith. 98(3), 245\u2013277 (2001).","journal-title":"Acta Arith."},{"key":"1118_CR30","unstructured":"The LMFDB Collaboration: The L-functions and modular forms database, home page of the l-function $$l(s,e)$$ for elliptic curve with lmfdb label 50.a3. https:\/\/www.lmfdb.org\/EllipticCurve\/Q\/50\/a\/3, [Online; accessed 26 April 2022]."},{"key":"1118_CR31","unstructured":"The LMFDB Collaboration: The L-functions and modular forms database, home page of the l-function $$l(s,e)$$ for elliptic curve with lmfdb label 10368.j1. https:\/\/www.lmfdb.org\/EllipticCurve\/Q\/10368\/j\/1, [Online; accessed 26 April 2022]."},{"issue":"4","key":"1118_CR32","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.jcta.2013.01.006","volume":"120","author":"ER van Dam","year":"2013","unstructured":"van Dam E.R., Omidi G.R.: Strongly walk-regular graphs. J. Comb. Theory A 120(4), 803\u2013810 (2013).","journal-title":"J. Comb. Theory A"},{"issue":"1","key":"1118_CR33","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF01223730","volume":"36","author":"HN Ward","year":"1981","unstructured":"Ward H.N.: Divisible codes. Arch. Math. (Basel) 36(1), 485\u2013494 (1981).","journal-title":"Arch. Math. (Basel)"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01118-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01118-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01118-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T07:51:30Z","timestamp":1676015490000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01118-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,15]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1118"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01118-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,15]]},"assertion":[{"value":"26 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}