On strongly walk regular graphs, triple sum sets and their codes
Autor: | Michael Kiermaier, Sascha Kurz, Patrick Solé, Michael Stoll, Alfred Wassermann |
---|---|
Přispěvatelé: | Universität Bayreuth, Institut de Mathématiques de Marseille (I2M), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), University of Bayreuth, Sol'e, Patrick |
Rok vydání: | 2022 |
Předmět: |
Applied Mathematics
[MATH.MATH-AG] Mathematics [math]/Algebraic Geometry [math.AG] triple sum sets Computer Science Applications [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO] strongly walk-regular graphs Primary 05E30 Secondary 11D41 94B05 [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT] [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] FOS: Mathematics Mathematics - Combinatorics Combinatorics (math.CO) [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT] [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG] three-weight codes |
Zdroj: | Designs, Codes and Cryptography Designs, Codes and Cryptography, 2022 |
ISSN: | 1573-7586 0925-1022 |
Popis: | Strongly walk regular graphs (SWRGs or $s$-SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length~2 are replaced by paths of length~$s$. 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$-SWRG has at most 4 distinct eigenvalues $k > \theta_1 > \theta_2 > \theta_3$, and that the triple $(\theta_1, \theta_2, \theta_3)$ satisfies a certain homogeneous polynomial equation of degree $s - 2$ (Van Dam, Omidi, 2013). This equation defines a plane algebraic curve; we use methods from algorithmic arithmetic geometry to show that for $s = 5$ and $s = 7$, there are only the obvious solutions, and we conjecture this to remain true for all (odd) $s \ge 9$. Comment: 42 pages |
Databáze: | OpenAIRE |
Externí odkaz: |