41 citations · 100 across the 28 of their papers we have counts for
33 papers
On the existence of linear rank-metric intersecting codes
Martino Borello, Olga Polverino, Ferdinando Zullo
Intersecting codes are a classical object in coding theory whose rank-metric analogue has recently been introduced. Although the definition formally parallels the Hamming-metric ca…
Decoding Trombetti-Zhou codes: a new syndrome-based decoding approach
Chunlei Li, Angelica Piccirillo, Olga Polverino +1
In 2019, Trombetti and Zhou introduced a new family of -linear Maximum Rank Distance (MRD) codes over . For such codes we propose a new syndr…
Delsarte duality on subspaces and applications to rank-metric codes and q-matroids
Martino Borello, Olga Polverino, Ferdinando Zullo
We study the interplay between the lattice of F_{q^m}-subspaces and the lattice of F_{q^m}-subspaces of an F_{q^m}-vector space. Introducing notions of weight and defect relative t…
Quasi-optimal cyclic orbit codes
Chiara Castello, Heide Gluesing-Luerssen, Olga Polverino +1
We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a c…
Full weight spectrum one-orbit cyclic subspace codes
Chiara Castello, Olga Polverino, Ferdinando Zullo
For a linear Hamming metric code of length n over a finite field, the number of distinct weights of its codewords is at most n. The codes achieving the equality in the above bound…
Two-weight rank-metric codes
Ferdinando Zullo, Olga Polverino, Paolo Santonastaso +1
Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting f…