alessandro neri

alessandro nerialessandro nerialessandro neri

alessandro neri

alessandro nerialessandro nerialessandro neri
  • Home
  • Research
  • Talks
  • Events
  • Supervision
  • Altro
    • Home
    • Research
    • Talks
    • Events
    • Supervision
  • Home
  • Research
  • Talks
  • Events
  • Supervision
Blu - Pandemia, Campobasso (Italy)

Research Publications

Journal Publications

  1. Higher-degree symmetric rank-metric codes (with A. Bik), SIAM Journal on Applied Algebra and Geometry, 8(4): 931-967, 2024. [arXiv] 
  2. Exceptional scattered sequences (with D. Bartoli, G. Marino and L. Vicino), Algebraic Combinatorics, 7(5): 1405-1431, 2024.  [arXiv]
  3. Strong blocking sets and minimal codes from expander graphs (with N. Alon, A. Bishnoi and S. Das), Transactions of the American Mathematical Society, 377: 5389–5410, 2024. [arXiv] 
  4. A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams (with M. Stanojkovski), Journal of Combinatorial Theory Series A, 208: 105937, 2024. [arXiv]
  5. Maximum Flag-Rank Distance Codes (with G. N. Alfarano and F. Zullo), Journal of Combinatorial Theory, Series A, 207: 105908, 2024. [arXiv]
  6. Outer strong blocking sets (with G. N. Alfarano and M. Borello), the Electronic Journal of Combinatorics,  31(2): P2.18, 2024. [arXiv]
  7. Valued rank-metric codes (with Y. El Maazouz, M. A. Hahn and M. Stanojkovski), Journal of Algebra and its Applications, 2023. [arXiv]
  8. Evasive subspaces, generalized rank weights and near MRD codes (with G. Marino and R. Trombetti), Discrete Mathematics, 346(12): 113605, 2023. [arXiv]
  9. The geometry of one-weight codes in the sum-rank metric (with P. Santonastaso and F. Zullo), Journal of Combinatorial Theory, Series A, 194: 105703, 2023. [arXiv] 
  10. Weighted Reed-Solomon convolutional codes (with G. N. Alfarano, D. Napp and V. Requena), Linear and Multilinear Algebra, 2023. [arXiv]
  11. Twisted Linearized Reed-Solomon Codes: A Skew Polynomial Framework, Journal of Algebra, 609: 792-839, 2022. [arXiv] 
  12. New MRD codes from linear cutting blocking sets (with D. Bartoli and G. Marino), Annali di Matematica Pura ed Applicata, 2022. [arXiv]
  13. Linear Cutting Blocking Sets and Minimal Codes in the Rank Metric (with G. N. Alfarano, M. Borello and A. Ravagnani), Journal of Combinatorial Theory, Series A, 192: 105658, 2022. [arXiv]
  14. Moderate-Density Parity-Check Codes from Projective Bundles (with J. Bariffi, S. Mattheus and J. Rosenthal), Designs, Codes and Cryptography, 2022. [arXiv] 
  15. Extending two families of maximum rank distance codes (with P. Santonastaso and F. Zullo), Finite Fields and Their Applications, 81: 102045, 2022. [arXiv] 
  16. Sum-rank product codes and bounds on the minimum distance (with G. N. Alfarano, F. J. Lobillo and A. Wachter-Zeh), Finite Fields and their Applications, 80: 102013, 2022. [arXiv] 
  17. Three Combinatorial Perspectives on Minimal Codes (with G. N. Alfarano, M. Borello and A. Ravagnani), SIAM Journal on Discrete Mathematics, 36(1): 461-489, 2022. [arXiv]
  18. Constructing Partial MDS Codes from Reducible Algebraic Curves (with T. Bogart, A.-L. Horlemann-Trautmann, D. Karpuk and M. Velasco), SIAM Journal on Discrete Mathematics, 35(4): 2946-2970, 2021. [arXiv] 
  19. Decoding of Interleaved Alternant Codes (with L. Holzbaur, H. Liu, S. Puchinger, J. Rosenkilde, V. Sidorenko and A. Wachter-Zeh), IEEE Transactions on Information Theory, 67(12): 8016-8033, 2021. [arXiv] 
  20. Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes (with D. Augot, A. Couvreur and J. Lavauzelle), SIAM Journal on Applied Algebra and Geometry, 5(2): 165-199, 2021. [arXiv] 
  21. Low-Rank Parity-Check Codes over Galois Rings (with J. Renner and S. Puchinger), Designs, Codes and Cryptography, 89: 351 386, 2021. [arXiv] 
  22. Roos bound for skew cyclic codes in Hamming and rank metric (with G. N. Alfarano and F. J. Lobillo), Finite Fields and Their Applications, 69: 101772, 2021. [arXiv] 
  23. A geometric characterization of minimal codes and their asymptotic performance (with G. N. Alfarano and M. Borello), Advances in Mathematics of Communications, 16(1): 115-133, 2022. [arXiv] 
  24. Equivalence and Characterizations of Linear Rank-Metric Codes Based on Invariant (with S. Puchinger and A.-L. Horlemann-Trautmann), Linear Algebra and its applications, 2020. [arXiv] 
  25. How many weights can a quasi-cyclic code have? (with M. Shi and P. Solé), IEEE Transactions on Information Theory, 66(11): 6855-6862, 2020. [Hal]
  26. Systematic encoders for generalized Gabidulin codes and the q-analogue of Cauchy matrices, Linear Algebra and its Applications, 593: 116-149, 2020. [arXiv]
  27. Random construction of partial MDS codes (with A.-L. Horlemann- Trautmann), Designs, Codes and Cryptography, 88: 711-725, 2020. [arXiv]
  28. New Lower Bounds for Permutation Codes using Linear Block Codes (with G. Micheli), IEEE Transactions on Information Theory, 66(7): 4019-4025, 2020. [arXiv]
  29. How many weights can a cyclic code have? (with M. Shi, X. Li and P. Solé), IEEE Transactions on Information Theory, 66(3): 1449-1459, 2020. [arXiv]
  30. Tensor representation of rank-metric codes (with E. Byrne, A. Ravagnani and J. Sheekey), SIAM Journal on Applied Algebra and Geometry, 3(4): 614-643, 2019. [arXiv] 
  31. A complete classification of partial-MDS (maximally recoverable) codes with one global parity, (with A.-L. Horlemann-Trautmann), Advances in Mathematics of Communications, 14(1): 69-88, 2020. [arXiv] 
  32. Maximum weight spectrum codes, (with T. L. Alderson), Advances in Mathematics of Communications, 13(1): 101-119, 2019. [arXiv] 
  33. On the genericity of maximum rank distance and Gabidulin codes (with A.-L. Horlemann-Trautmann, T. Randrianarisoa, and J. Rosenthal), Designs, Codes and Cryptography, 86(2): 341-363, 2018. [arXiv] 
  34. Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance (with J. G mez-Torrecillas, F. J. Lobillo and G. Navarro), Finite Fields and Their Applications, 50: 84-112, 2018. [arXiv] 

Conference Proceedings

  1. Success Probability of Decoding Interleaved Alternant Codes (with L. Holzbaur, H. Liu, S. Puchinger, J. Rosenkilde, V. Sidorenko and A. Wachter-Zeh), in 2020 IEEE Information Theory Workshop, 2021. 
  2. Invariants and inequivalence of linear rank-metric codes (with S. Puchinger and A.-L. Horlemann-Trautmann), in IEEE International Symposium on Information Theory, pp. 2049-2053, 2019. [arXiv] 
  3. Fuzzy Authentication using Rank Distance (with J. Rosenthal and D. Schipani), in International Worskhop on Communication Security, Lecture Notes in Electrical Engineering, Springer, 97-108, 2017. [arXiv] 

Extended Abstracts

  1. Expander graphs, strong blocking sets and minimal codes (with N. Alon, A. Bishnoi and S. Das). European Conference on Combinatorics, Graph Theory and Applications. (EUROCOMB'23), 12, pp. 19--27, 2023.
  2. Identifying rank-metric codes using Galois group action, in the Oberwolfach Report of the conference Contemporary Coding Theory (ID 1912), 2019. 

Preprints

  1. Representability of the direct sum of uniform q-matroids (with G. N. Alfarano, R. Jurrius and F. Zullo), arXiv preprint, arXiv:2408.00630, 2024.
  2. Eigenvalue bounds for the distance-t chromatic number of a graph and their application to Lee codes (with A. Abiad and L. Reijnders), arXiv preprint, arXiv:2404.14839, 2024.

Monographs

  1. Algebraic Theory of Rank-Metric Codes: Representations, Invariants and Density Results. Ph.D.. Thesis, University of Zurich, Switzerland, 2019. [pdf]
  2. Decoding Reed Solomon and BCH codes beyond their error-correction radius: an euclidean approach . M.Sc. thesis, University of Pisa, Italy, 2014 [pdf]
  3. Un algoritmo polinomiale sulla risolubilità per radicali. B.Sc. thesis (in Italian), University of Pisa, Italy, 2010.

 
 

Copyright © 2023 alessandroneri.eu - All rights reserved.

AN

Questo sito web usa cookie.

Utilizziamo i cookie per analizzare il traffico sul sito web e ottimizzare l'esperienza con il tuo sito. Accettando l'uso dei cookie da parte nostra, i tuoi dati saranno aggregati con i dati di tutti gli altri utenti.

Accetta