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

80 papers

math.CO2026

Non-additive symmetric rank-metric codes

Marta Messia, Ferdinando Zullo

We study non-additive rank-metric codes contained in the space of symmetric matrices over a finite field. Our main focus is on symmetric -codes. For odd , we introduce a quot…

math.CO2026

Construction of Regular Fat Linear Sets and Non-Representable q-Matroids

Yufei Qiu, Valentino Smaldore, Zhenpeng Wang +2

Let be a prime power. An -regular fat -linear set has exactly points of weight , called fat points. All of its remaining points have weight one,…

math.CO2026

Sunflowers of Reed--Solomon Codes

Roni Con, Anina Gruica, Maria Montanucci +1

We introduce and study Reed--Solomon sunflowers, namely families of Reed--Solomon codes whose pairwise intersections are all equal to the same fixed subspace. This notion lies at t…

cs.IT2026

Asymptotic Bounds on Generalized Covering Radii of Binary Primitive BCH Codes

Maosheng Xiong, Chi Hoi Yip, Ferdinando Zullo

Fix integers and . In this paper we study the -th generalized covering radius of the binary primitive -error-correcting BCH code $BC…

cs.IT2026

The Generalized Random Access Problem for Linear Codes

Anina Gruica, Antonio Petrillo, Ferdinando Zullo

Random access is a central requirement in DNA-based storage systems: one would like to recover selected information symbols without sequencing the whole encoded object. A recent co…

math.CO2026

Weak arcs and applications to the DNA-based storage access problem

Geertrui Van de Voorde, Ferdinando Zullo

Weak arcs are point sets in PG meeting every general hyperplane (those are the hyperplanes not going through one of the points given by the standard basis vectors) in at m…