Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Ŝvob, Andrea"'
In this paper, we introduce orbit matrices of directed strongly regular graphs (DSRGs). Further, we propose a method of constructing directed strongly regular graphs with prescribed automorphism group using genetic algorithm. In the construction, we
Externí odkaz:
http://arxiv.org/abs/2412.14787
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing self-orthogonal
Externí odkaz:
http://arxiv.org/abs/2407.05695
In 1976, Delsarte introduced the notion of $q$-analogs of designs, and $q$-analogs of graphs were introduced recently by M. Braun et al. In this paper, we extend that study by giving a method for constructing transitive regular $q$-analogs of graphs.
Externí odkaz:
http://arxiv.org/abs/2406.07118
Divisible design graphs were introduced in 2011 by Haemers, Kharaghani and Meulenberg. In this paper, we introduce the notion of $q$-analogs of divisible design graphs and show that all $q$-analogs of divisible design graphs come from spreads, and ar
Externí odkaz:
http://arxiv.org/abs/2405.13230
In this paper, we prove the existence of directed strongly regular graphs with parameters $(63,11,8,1,2)$. We construct a pair of nonisomorphic dsrg(63,11,8,1,2), where one is obtained from the other by reversing all arrows. Both directed strongly re
Externí odkaz:
http://arxiv.org/abs/2404.03100
In this paper, we give a construction of doubly even self-orthogonal codes from quasi-symmetric designs. Further, we study orbit matrices of quasi-symmetric designs and give a construction of doubly even self-orthogonal codes from orbit matrices of q
Externí odkaz:
http://arxiv.org/abs/2308.01075
A code $C$ is a subset of the vertex set of a graph and $C$ is $s$-neighbour-transitive if its automorphism group ${\rm Aut}(C)$ acts transitively on each of the first $s+1$ parts $C_0,C_1,\ldots,C_s$ of the distance partition $\{C=C_0,C_1,\ldots,C_\
Externí odkaz:
http://arxiv.org/abs/2307.09752
Autor:
Crnkovic, Dean, Svob, Andrea
A subspace code is a nonempty set of subspaces of a vector space $\mathbb F^n_q$. Linear codes with complementary duals, or LCD codes, are linear codes whose intersection with their duals is trivial. In this paper, we introduce a notion of LCD subspa
Externí odkaz:
http://arxiv.org/abs/2204.08552
Publikováno v:
In Linear Algebra and Its Applications 15 July 2024 693:362-373
Autor:
Crnković, Dean, Švob, Andrea
In this paper we introduce a switching for 2-designs. We illustrate this method by applying it to some symmetric (64,28,12) designs. In that way we obtain six new symmetric (64,28,12) designs. Further, we show that this type of switching can be appli
Externí odkaz:
http://arxiv.org/abs/2108.02529