activity
20162026
most citedA characterization of linearized polynomials with maximum kernel

41 citations · 125 across the 60 of their papers we have counts for

collaborators
Showing 2021Show all

11 papers · 1 filter

math.CO2021

Two pointsets in and the associated codes

Vito Napolitano, Olga Polverino, Paolo Santonastaso +1

In this paper we consider two pointsets in arising from a linear set of rank contained in a line of : the first one is a linear blo…

cs.IT2021

The geometry of one-weight codes in the sum-rank metric

Alessandro Neri, Paolo Santonastaso, Ferdinando Zullo

We provide a geometric characterization of -dimensional -linear sum-rank metric codes as tuples of -subspaces of . We then us…

math.CO2021★ 1 cited

Multi-orbit cyclic subspace codes and linear sets

Ferdinando Zullo

Cyclic subspace codes gained a lot of attention especially because they may be used in random network coding for correction of errors and erasures. Roth, Raviv and Tamo in 2018 est…

cs.IT2021

Linear maximum rank distance codes of exceptional type

Daniele Bartoli, Giovanni Zini, Ferdinando Zullo

Scattered polynomials of a given index over finite fields are intriguing rare objects with many connections within mathematics. Of particular interest are the exceptional ones, as…

math.CO2021

Linear sets on the projective line with complementary weights

Vito Napolitano, Olga Polverino, Paolo Santonastaso +1

Linear sets on the projective line have attracted a lot of attention because of their link with blocking sets, KM-arcs and rank-metric codes. In this paper, we study linear sets ha…

math.CO2021

On the infiniteness of a family of APN functions

Daniele Bartoli, Marco Calderini, Olga Polverino +1

APN functions play a fundamental role in cryptography against attacks on block ciphers. Several families of quadratic APN functions have been proposed in the recent years, whose co…