3 citations · 9 across the 19 of their papers we have counts for
6 papers · 1 filter
The complexity of solving Weil restriction systems
Alessio Caminata, Michela Ceria, Elisa Gorla
The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods.…
The direct sum of -matroids
Michela Ceria, Relinde Jurrius
For classical matroids, the direct sum is one of the most straightforward methods to make a new matroid out of existing ones. This paper defines a direct sum for -matroids, the…
On near-MDS codes and caps
Michela Ceria, Antonio Cossidente, Giuseppe Marino +1
Several classes of near-MDS codes of are described. They are obtained either by considering the intersection of an elliptic quadric ovoid and a Suzuki-Tits ovoid of…
Some hypersurfaces over finite fields, minimal codes and secret sharing schemes
Angela Aguglia, Michela Ceria, Luca Giuzzi
Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particul…
Weighted Subspace Designs from -Polymatroids
Eimear Byrne, Michela Ceria, Sorina Ionica +1
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further t…
Constructions of New q-Cryptomorphisms
Eimear Byrne, Michela Ceria, Relinde Jurrius
In the theory of classical matroids, there are several known equivalent axiomatic systems that define a matroid, which are described as matroid cryptomorphisms. A q-matroid is a q-…