activity
20172026
most citedA geometric characterization of minimal codes and their asymptotic performance

44 citations · 73 across the 16 of their papers we have counts for

collaborators
Showing math.COShow all

10 papers · 1 filter

math.CO2026

Irreducible Ferrers diagrams in the Etzion-Silberstein conjecture

Hugo Beeloo-Sauerbier Couvée, Alessandro Neri

The Etzion-Silberstein conjecture asserts that, for any finite field , Ferrers diagram , and integer , there exists a linear matrix code supported on $\ma…

math.CO2023

A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams

Alessandro Neri, Mima Stanojkovski

Ferrers diagram rank-metric codes were introduced by Etzion and Silberstein in 2009. In their work, they proposed a conjecture on the largest dimension of a space of matrices over…

math.CO2023

Strong blocking sets and minimal codes from expander graphs

Noga Alon, Anurag Bishnoi, Shagnik Das +1

A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets:…

math.CO2023

Maximum Flag-Rank Distance Codes

Gianira N. Alfarano, Alessandro Neri, Ferdinando Zullo

In this paper we extend the study of linear spaces of upper triangular matrices endowed with the flag-rank metric. Such metric spaces are isometric to certain spaces of degenerate…

math.CO20221 cited

Exceptional scattered sequences

Daniele Bartoli, Giuseppe Marino, Alessandro Neri +1

The concept of scattered polynomials is generalized to those of exceptional scattered sequences which are shown to be the natural algebraic counterpart of -linear…

math.CO20229 cited

New MRD codes from linear cutting blocking sets

Daniele Bartoli, Giuseppe Marino, Alessandro Neri

Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness pro…