67 citations · 110 across the 23 of their papers we have counts for
6 papers · 1 filter
Tensor Codes and their Invariants
Eimear Byrne, Giuseppe Cotardo
In 1991, Roth introduced a natural generalization of rank metric codes, namely tensor codes. The latter are defined to be subspaces of -tensors where the ambient space is endowe…
Bounds in the Lee Metric and Optimal Codes
Eimear Byrne, Violetta Weger
In this paper we investigate known Singleton-like bounds in the Lee metric and characterize optimal codes, which turn out to be very few. We then focus on Plotkin-like bounds in th…
Density of Free Modules over Finite Chain Rings
Eimear Byrne, Anna-Lena Horlemann, Karan Khathuria +1
In this paper we focus on modules over a finite chain ring of size . We compute the density of free modules of , where we separately treat the asy…
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-…
Bilinear Complexity of 3-Tensors Linked to Coding Theory
Eimear Byrne, Giuseppe Cotardo
A well studied problem in algebraic complexity theory is the determination of the complexity of problems relying on evaluations of bilinear maps. One measure of the complexity of a…