41 citations · 45 across the 24 of their papers we have counts for
4 papers · 1 filter
Combining subspace codes
Antonio Cossidente, Sascha Kurz, Giuseppe Marino +1
In the context of constant--dimension subspace codes, an important problem is to determine the largest possible size of codes whose codewords are -subspaces of $\…
On the PSU(4, 2)-invariant vertex-transitive strongly regular (216, 40, 4, 8) graph
Dean Crnković, Francesco Pavese, Andrea Švob
In 2018 the first, Rukavina and the third author constructed with the aid of a computer the first example of a strongly regular graph with parameters (216, 40, 4, 8) and proved…
Subspace code constructions
Antonio Cossidente, Giuseppe Marino, Francesco Pavese
We improve on the lower bound of the maximum number of planes of mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4;…
On -covering designs
Francesco Pavese
A -covering design , , is a collection of -spaces of such that every -space of $\mathrm{PG}(n-1,…