6 papers · 1 filter
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…
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…
On one-orbit cyclic subspace codes of
Chiara Castello, Olga Polverino, Ferdinando Zullo
Subspace codes have recently been used for error correction in random network coding. In this work, we focus on one-orbit cyclic subspace codes. If is an -subspac…