1 citations · 1 across the 3 of their papers we have counts for
8 papers
Strongly regular graphs with parameters (81,30,9,12) and a new partial geometry pg(5,5,2)
Dean Crnković, Andrea Švob, Vladimir D. Tonchev
Twelve new strongly regular graphs with parameters (81,30,9,12) are found as graphs invariant under certain subgroups of the automorphism groups of the two previously known graphs…
LDPC codes constructed from cubic symmetric graphs
Dean Crnkovic, Sanja Rukavina, Marina Simac
Low-density parity-check (LDPC) codes have been the subject of much interest due to the fact that they can perform near the Shannon limit. In this paper we present a construction o…
New constructions of Deza digraphs
Dean Crnkovic, Hadi Kharaghani, Sho Suda +1
Deza digraphs were introduced in 2003 by Zhang and Wang as directed graph version of Deza graphs, that also generalize the notion of directed strongly regular graphs. In this paper…
Divisible design Cayley digraphs
Dean Crnkovic, Hadi Kharaghani, Andrea Svob
Divisible design digraphs which can be obtained as Cayley digraphs are studied. A characterization of divisible design Cayley digraphs in terms of the generating sets is given. Fur…
Self-orthogonal codes from equitable partitions of association schemes
Dean Crnkovic, Sanja Rukavina, Andrea Svob
We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distan…
LCD codes from weighing matrices
Dean Crnkovic, Ronan Egan, B. G. Rodrigues +1
Linear codes with complementary duals are linear codes whose intersection with their duals are trivial, shortly named LCD codes. In this paper we outline a construction for LCD cod…