default search action
Alessandro Neri 0002
Person information
- affiliation: Ghent University, Department of Mathematics, Belgium
- affiliation (2021 - 2022): Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
- affiliation (2020 - 2021): Techincal University of Munich, Germany
- affiliation (PhD 2019): University of Zurich, Department of Mathematics, Switzerland
Other persons with the same name
- Alessandro Neri 0001
— University of Roma TRE, Roma, Italy
- Alessandro Neri 0003
- Alessandro Neri 0005
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Gianira N. Alfarano, Martino Borello, Alessandro Neri
Outer Strong Blocking Sets. Electron. J. Comb. 31(2) (2024) - [j24]Gianira N. Alfarano
Maximum flag-rank distance codes. J. Comb. Theory, Ser. A 207: 105908 (2024) - [j23]Alessandro Neri
A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams. J. Comb. Theory, Ser. A 208: 105937 (2024) - [i35]Aida Abiad, Alessandro Neri, Luuk Reijnders:
Eigenvalue bounds for the distance-t chromatic number of a graph and their application to Lee codes. CoRR abs/2404.14839 (2024) - 2023
- [j22]Giuseppe Marino, Alessandro Neri
Evasive subspaces, generalized rank weights and near MRD codes. Discret. Math. 346(12): 113605 (2023) - [j21]Alessandro Neri
The geometry of one-weight codes in the sum-rank metric. J. Comb. Theory A 194: 105703 (2023) - [i34]Gianira N. Alfarano, Martino Borello, Alessandro Neri:
Outer Strong Blocking Sets. CoRR abs/2301.09590 (2023) - [i33]Arthur Bik
Higher-degree symmetric rank-metric codes. CoRR abs/2303.06745 (2023) - [i32]Gianira N. Alfarano, Alessandro Neri, Ferdinando Zullo:
Maximum Flag-Rank Distance Codes. CoRR abs/2303.16653 (2023) - [i31]Noga Alon, Anurag Bishnoi, Shagnik Das, Alessandro Neri:
Strong blocking sets and minimal codes from expander graphs. CoRR abs/2305.15297 (2023) - [i30]Alessandro Neri, Mima Stanojkovski:
A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams. CoRR abs/2306.16407 (2023) - 2022
- [j20]Gianira N. Alfarano
A geometric characterization of minimal codes and their asymptotic performance. Adv. Math. Commun. 16(1): 115-133 (2022) - [j19]Jessica Bariffi
Moderate-density parity-check codes from projective bundles. Des. Codes Cryptogr. 90(12): 2943-2966 (2022) - [j18]Gianira N. Alfarano
Sum-rank product codes and bounds on the minimum distance. Finite Fields Their Appl. 80: 102013 (2022) - [j17]Alessandro Neri
Extending two families of maximum rank distance codes. Finite Fields Their Appl. 81: 102045 (2022) - [j16]Gianira N. Alfarano
Linear cutting blocking sets and minimal codes in the rank metric. J. Comb. Theory A 192: 105658 (2022) - [j15]Gianira N. Alfarano, Martino Borello, Alessandro Neri
Three Combinatorial Perspectives on Minimal Codes. SIAM J. Discret. Math. 36(1): 461-489 (2022) - [i29]Giuseppe Marino, Alessandro Neri, Rocco Trombetti:
Evasive subspaces, generalized rank weights and near MRD codes. CoRR abs/2204.11791 (2022) - [i28]Daniele Bartoli, Giuseppe Marino, Alessandro Neri:
New MRD codes from linear cutting blocking sets. CoRR abs/2209.02586 (2022) - [i27]Daniele Bartoli, Giuseppe Marino, Alessandro Neri, Lara Vicino:
Exceptional scattered sequences. CoRR abs/2211.11477 (2022) - 2021
- [j14]Julian Renner, Alessandro Neri
Low-rank parity-check codes over Galois rings. Des. Codes Cryptogr. 89(2): 351-386 (2021) - [j13]Gianira N. Alfarano
Roos bound for skew cyclic codes in Hamming and rank metric. Finite Fields Their Appl. 69: 101772 (2021) - [j12]Daniel Augot, Alain Couvreur, Julien Lavauzelle, Alessandro Neri
Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed-Muller Codes. SIAM J. Appl. Algebra Geom. 5(2): 165-199 (2021) - [j11]Tristram Bogart, Anna-Lena Horlemann-Trautmann
Constructing Partial MDS Codes from Reducible Algebraic Curves. SIAM J. Discret. Math. 35(4): 2946-2970 (2021) - [j10]Lukas Holzbaur
Decoding of Interleaved Alternant Codes. IEEE Trans. Inf. Theory 67(12): 8016-8033 (2021) - [i26]Jessica Bariffi, Sam Mattheus, Alessandro Neri, Joachim Rosenthal:
Moderate Density Parity-Check Codes from Projective Bundles. CoRR abs/2103.09722 (2021) - [i25]Yassine El Maazouz, Marvin Anas Hahn, Alessandro Neri, Mima Stanojkovski:
Valued rank-metric codes. CoRR abs/2104.03216 (2021) - [i24]Alessandro Neri, Paolo Santonastaso, Ferdinando Zullo:
Extending two families of maximum rank distance codes. CoRR abs/2104.07602 (2021) - [i23]Alessandro Neri:
Twisted Linearized Reed-Solomon Codes: A Skew Polynomial Framework. CoRR abs/2105.10451 (2021) - [i22]Gianira N. Alfarano, Francisco Javier Lobillo, Alessandro Neri, Antonia Wachter-Zeh:
Sum-rank product codes and bounds on the minimum distance. CoRR abs/2105.15086 (2021) - [i21]Gianira N. Alfarano, Martino Borello, Alessandro Neri, Alberto Ravagnani:
Linear Cutting Blocking Sets and Minimal Codes in the Rank Metric. CoRR abs/2106.12465 (2021) - [i20]Alessandro Neri, Paolo Santonastaso, Ferdinando Zullo:
The geometry of one-weight codes in the sum-rank metric. CoRR abs/2112.04989 (2021) - 2020
- [j9]Anna-Lena Horlemann-Trautmann
A complete classification of partial MDS (maximally recoverable) codes with one global parity. Adv. Math. Commun. 14(1): 69-88 (2020) - [j8]Alessandro Neri
Random construction of partial MDS codes. Des. Codes Cryptogr. 88(4): 711-725 (2020) - [j7]Minjia Shi
How Many Weights Can a Cyclic Code Have? IEEE Trans. Inf. Theory 66(3): 1449-1459 (2020) - [j6]Giacomo Micheli
New Lower Bounds for Permutation Codes Using Linear Block Codes. IEEE Trans. Inf. Theory 66(7): 4019-4025 (2020) - [j5]Minjia Shi
How Many Weights Can a Quasi-Cyclic Code Have? IEEE Trans. Inf. Theory 66(11): 6855-6862 (2020) - [c2]Lukas Holzbaur, Hedongliang Liu, Alessandro Neri, Sven Puchinger, Johan Rosenkilde, Vladimir Sidorenko, Antonia Wachter-Zeh:
Success Probability of Decoding Interleaved Alternant Codes. ITW 2020: 1-5 - [i19]Gianira N. Alfarano, Francisco Javier Lobillo, Alessandro Neri:
Roos bound for skew cyclic codes in Hamming and rank metric. CoRR abs/2002.02327 (2020) - [i18]Julian Renner, Alessandro Neri, Sven Puchinger:
Low-Rank Parity-Check Codes over Galois Rings. CoRR abs/2006.10588 (2020) - [i17]Daniel Augot, Alain Couvreur, Julien Lavauzelle, Alessandro Neri:
Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes. CoRR abs/2006.14489 (2020) - [i16]Tristram Bogart, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Alessandro Neri, Mauricio Velasco:
Constructing Partial MDS Codes from Reducible Curves. CoRR abs/2007.14829 (2020) - [i15]Lukas Holzbaur, Hedongliang Liu, Alessandro Neri, Sven Puchinger, Johan Rosenkilde, Vladimir Sidorenko, Antonia Wachter-Zeh:
Decoding of Interleaved Alternant Codes. CoRR abs/2010.07142 (2020) - [i14]Gianira N. Alfarano, Martino Borello, Alessandro Neri, Alberto Ravagnani:
Three Combinatorial Perspectives on Minimal Codes. CoRR abs/2010.16339 (2020) - [i13]Gianira N. Alfarano, Diego Napp, Alessandro Neri, Verónica Requena:
Weighted Reed-Solomon convolutional codes. CoRR abs/2012.11417 (2020)
2010 – 2019
- 2019
- [j4]Tim L. Alderson
Maximum weight spectrum codes. Adv. Math. Commun. 13(1): 101-119 (2019) - [j3]Eimear Byrne, Alessandro Neri
Tensor Representation of Rank-Metric Codes. SIAM J. Appl. Algebra Geom. 3(4): 614-643 (2019) - [c1]Alessandro Neri
Invariants and Inequivalence of Linear Rank-Metric Codes. ISIT 2019: 2049-2053 - [i12]Giacomo Micheli, Alessandro Neri:
New Lower Bounds for Permutation Codes using Linear Block Codes. CoRR abs/1901.08858 (2019) - [i11]Eimear Byrne, Alessandro Neri, Alberto Ravagnani, John Sheekey:
Tensor Representation of Rank-Metric Codes. CoRR abs/1904.05227 (2019) - [i10]Alessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann:
Invariants and Inequivalence of Linear Rank-Metric Codes. CoRR abs/1905.11326 (2019) - [i9]Gianira Nicoletta Alfarano, Martino Borello, Alessandro Neri:
A geometric characterization of minimal codes and their asymptotic performance. CoRR abs/1911.11738 (2019) - [i8]Alessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann:
Equivalence and Characterizations of Linear Rank-Metric Codes Based on Invariants. CoRR abs/1911.13059 (2019) - 2018
- [j2]Alessandro Neri
On the genericity of maximum rank distance and Gabidulin codes. Des. Codes Cryptogr. 86(2): 341-363 (2018) - [j1]José Gómez-Torrecillas
Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance. Finite Fields Their Appl. 50: 84-112 (2018) - [i7]Alessandro Neri, Anna-Lena Horlemann-Trautmann:
Random Construction of Partial MDS Codes. CoRR abs/1801.05848 (2018) - [i6]Tim L. Alderson, Alessandro Neri:
Maximum Weight Spectrum Codes. CoRR abs/1803.04020 (2018) - [i5]Alessandro Neri:
Systematic encoders for generalized Gabidulin codes and the q-analogue of Cauchy matrices. CoRR abs/1805.06706 (2018) - 2017
- [i4]Alessandro Neri, Joachim Rosenthal, Davide Schipani:
Fuzzy Authentication using Rank Distance. CoRR abs/1703.03235 (2017) - [i3]Anna-Lena Horlemann-Trautmann, Alessandro Neri:
A Complete Classification of Partial-MDS (Maximally Recoverable) Codes with One Global Parity. CoRR abs/1707.00847 (2017) - [i2]José Gómez-Torrecillas, Gabriel Navarro, Francisco Javier Lobillo, Alessandro Neri:
Hartmann-Tzeng bound and Skew Cyclic Codes of Designed Hamming Distance. CoRR abs/1711.03515 (2017) - 2016
- [i1]Alessandro Neri, Anna-Lena Horlemann-Trautmann, Tovohery Randrianarisoa, Joachim Rosenthal:
On the Genericity of Maximum Rank Distance and Gabidulin Codes. CoRR abs/1605.05972 (2016)
Coauthor Index
aka: Gianira Nicoletta Alfarano
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: