1 citations · 2 across the 14 of their papers we have counts for
16 papers
Symmetric 2-(35,17,8) designs with an automorphism of order 2
Sanja Rukavina, Vladimir D. Tonchev
The largest prime p that can be the order of an automorphism of a 2-(35,17,8) design is p=17, and all 2-(35,17,8) designs with an automorphism of order 17 were classified by Tonche…
Construction of directed strongly regular graphs with nontrivial automorphisms
Marija Maksimović, Sanja Rukavina
In this paper we present a method for constructing directed strongly regular graphs with assumed action of an automorphism group. The application of this method leads to first exam…
Construction of extremal Type II -codes via doubling method
Sara Ban, Sanja Rukavina
Extremal Type II -codes are a class of self-dual -codes with Euclidean weights divisible by and the largest possible minimum Euclidean weight f…
Symmetric 2(36,15,6) designs with an automorphism of order two
Sanja Rukavina, Vladimir D. Tonchev
The parameters 2-(36,15,6) are the smallest parameters of symmetric designs for which a complete classification up to isomorphism is yet unknown. Bouyukliev, Fack and Winne classif…
New examples of self-dual near-extremal ternary codes of length 48 derived from 2-(47,23,11) designs
Sanja Rukavina, Vladimir D. Tonchev
In a recent paper [M. Araya, M. Harada, Some restrictions on the weight enumerators of near-extremal ternary self-dual codes and quaternary Hermitian self-dual codes, Des. Codes Cr…
New extremal Type II -codes of length 64 by the doubling method
Sara Ban, Sanja Rukavina
Extremal Type II -codes are a class of self-dual -codes with Euclidean weights divisible by eight and the largest possible minimum Euclidean weight for…
Characterizing bipartite distance-regularized graphs with vertices of eccentricity 4
Blas Fernández, Marija Maksimović, Sanja Rukavina
The characterization of bipartite distance-regularized graphs, where some vertices have eccentricity less than four, in terms of the incidence structures of which they are incidenc…
On symmetric 2-(70,24,8) designs with an automorphism of order 6
Sanja Rukavina, Vladimir D. Tonchev
In this paper we analyze possible actions of an automorphism of order six on a - design, and give a complete classification for the action of the cyclic automorphis…
Extremal ternary self-dual codes of length 36 and symmetric 2-(36,15,6) designs with an automorphism of order 2
Sanja Rukavina, Vladimir D. Tonchev
In this note we report the classification of all symmetric 2-(36,15,6) designs that admit an automorphism of order 2 and their incidence matrices generate an extremal ternary self-…
Type IV-II codes over Z4 constructed from generalized bent functions
Sara Ban, Sanja Rukavina
A Type IV-II Z4-code is a self-dual code over Z4 with the property that all Euclidean weights are divisible by eight and all codewords have even Hamming weight. In this paper we us…
On automorphism groups of a biplane (121,16,2)
Dean Crnković, Doris Dumičić Danilović, Sanja Rukavina
The existence of a biplane with parameters is an open problem. Recently, it has been proved by Alavi, Daneshkhah and Praeger that the order of an automorphism group of…
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…
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…
On some distance-regular graphs with many vertices
Dean Crnkovic, Sanja Rukavina, Andrea Svob
We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups and , the orthogonal group …
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…
Classification of quasi-symmetric 2-(64,24,46) designs of Blokhuis-Haemers type
Dean Crnkovic, Bernardo Rodrigues, Sanja Rukavina +1
This paper completes the classification of quasi-symmetric 2- designs of Blokhuis-Haemers type supported by the dual code of the binary linear code span…