Alessandro Neri

Orcid: 0000-0002-2020-1040

Affiliations:
  • Ghent University, Department of Mathematics, Belgium
  • Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany (2021 - 2022)
  • Techincal University of Munich, Germany (2020 - 2021)
  • University of Zurich, Department of Mathematics, Switzerland (PhD 2019)


According to our database1, Alessandro Neri authored at least 38 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Evasive subspaces, generalized rank weights and near MRD codes.
Discret. Math., December, 2023

The geometry of one-weight codes in the sum-rank metric.
J. Comb. Theory, Ser. A, 2023

A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams.
CoRR, 2023

Strong blocking sets and minimal codes from expander graphs.
CoRR, 2023

Maximum Flag-Rank Distance Codes.
CoRR, 2023

Higher-degree symmetric rank-metric codes.
CoRR, 2023

Outer Strong Blocking Sets.
CoRR, 2023

2022
Three Combinatorial Perspectives on Minimal Codes.
SIAM J. Discret. Math., 2022

Linear cutting blocking sets and minimal codes in the rank metric.
J. Comb. Theory, Ser. A, 2022

Extending two families of maximum rank distance codes.
Finite Fields Their Appl., 2022

Sum-rank product codes and bounds on the minimum distance.
Finite Fields Their Appl., 2022

Moderate-density parity-check codes from projective bundles.
Des. Codes Cryptogr., 2022

Exceptional scattered sequences.
CoRR, 2022

New MRD codes from linear cutting blocking sets.
CoRR, 2022

A geometric characterization of minimal codes and their asymptotic performance.
Adv. Math. Commun., 2022

2021
Decoding of Interleaved Alternant Codes.
IEEE Trans. Inf. Theory, 2021

Constructing Partial MDS Codes from Reducible Algebraic Curves.
SIAM J. Discret. Math., 2021

Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed-Muller Codes.
SIAM J. Appl. Algebra Geom., 2021

Roos bound for skew cyclic codes in Hamming and rank metric.
Finite Fields Their Appl., 2021

Low-rank parity-check codes over Galois rings.
Des. Codes Cryptogr., 2021

Twisted Linearized Reed-Solomon Codes: A Skew Polynomial Framework.
CoRR, 2021

Valued rank-metric codes.
CoRR, 2021

2020
How Many Weights Can a Quasi-Cyclic Code Have?
IEEE Trans. Inf. Theory, 2020

How Many Weights Can a Cyclic Code Have?
IEEE Trans. Inf. Theory, 2020

New Lower Bounds for Permutation Codes Using Linear Block Codes.
IEEE Trans. Inf. Theory, 2020

Random construction of partial MDS codes.
Des. Codes Cryptogr., 2020

Weighted Reed-Solomon convolutional codes.
CoRR, 2020

Constructing Partial MDS Codes from Reducible Curves.
CoRR, 2020

A complete classification of partial MDS (maximally recoverable) codes with one global parity.
Adv. Math. Commun., 2020

Success Probability of Decoding Interleaved Alternant Codes.
Proceedings of the IEEE Information Theory Workshop, 2020

2019
Tensor Representation of Rank-Metric Codes.
SIAM J. Appl. Algebra Geom., 2019

Equivalence and Characterizations of Linear Rank-Metric Codes Based on Invariants.
CoRR, 2019

Maximum weight spectrum codes.
Adv. Math. Commun., 2019

Invariants and Inequivalence of Linear Rank-Metric Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance.
Finite Fields Their Appl., 2018

On the genericity of maximum rank distance and Gabidulin codes.
Des. Codes Cryptogr., 2018

Systematic encoders for generalized Gabidulin codes and the q-analogue of Cauchy matrices.
CoRR, 2018

2017
Fuzzy Authentication using Rank Distance.
CoRR, 2017


  Loading...