6 papers
Constructions of self-orthogonal and LCD subspace codes
Dean Crnković, Keita Ishizuka, Hadi Kharaghani +2
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 studie…
Transitive regular -analogs of graphs
Dean Crnkovic, Vedrana Mikulic Crnkovic, Andrea Svob +1
In 1976, Delsarte introduced the notion of -analogs of designs, and -analogs of graphs were introduced recently by M. Braun et al. In this paper, we extend that study by givi…
A construction of directed strongly regular graphs with parameters (63,11,8,1,2)
Andries E. Brouwer, Dean Crnković, Andrea Švob
In this paper, we prove the existence of directed strongly regular graphs with parameters . We construct a pair of nonisomorphic dsrg(63,11,8,1,2), where one is obta…
Doubly even self-orthogonal codes from quasi-symmetric designs
Dean Crnković, Doris Dumičić Danilović, Ana Šumberac +1
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 cons…
Neighbour-transitive codes in Kneser graphs
Dean Crnković, Daniel R. Hawtin, Nina Mostarac +1
A code is a subset of the vertex set of a graph and is -neighbour-transitive if its automorphism group acts transitively on each of the first parts…
Strongly regular graphs from orthogonal groups and
Dean Crnković, Sanja Rukavina, Andrea Švob
In this paper we construct all strongly regular graphs, with at most 600 vertices, admitting a transitive action of the orthogonal group or . Consequently, we…