Elisa Gorla

Elisa Gorla

Auto-generated profile, based on publicly available information

Elisa Gorla

Institute of Mathematics, University of Neuchtel, Neuchtel, Switzerland

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 May 2019 in Journal of Algebraic Combinatorics
Verified
Journal Article
Closed access
PDF file
EGElisa Gorla
Elisa Gorla
RJRelinde Jurrius
Relinde Jurrius
HLHiram H. López
Hiram H. López
ARAlberto Ravagnani
Alberto Ravagnani

11 January 2017 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
JCJavier de la Cruz
Javier de la Cruz
EGElisa Gorla
Elisa Gorla
HLHiram H. López
Hiram H. López
ARAlberto Ravagnani
Alberto Ravagnani

2 March 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ECEduardo Camps-Moreno
Eduardo Camps-Moreno
EGElisa Gorla
Elisa Gorla
CLCristina Landolina
Cristina Landolina
EGElisa Lorenzo Garcia
Elisa Lorenzo Garcia
UMUmberto Martinez-Penas
Umberto Martinez-Penas
FSFlavio Salizzoni
Flavio Salizzoni
Sum-rank metric codes have recently attracted the attention of many researchers, due to their relevance in several applications. Mathematically, the sum-rank metric is a natural generalization of both the Hamming metric and the rank metric. In this paper, we provide an Anticode Bound for the sum-rank metric, which extends the corresponding Hamming and rank-metric Anticode bounds. We classify then optimal anticodes, i.e., codes attaining the sum-rank metric Anticode Bound. We use these optimal anticodes to define generalized sum-rank weights and we study their main properties. In particular, we prove that the generalized weights of an MSRD code are determined by its parameters. As an application, in the Appendix we explain how generalized weights measure information leakage in multishot network coding.

1 January 2012 in Advances in Mathematics of Communications
Verified
Journal Article
Open access
PDF file
EGElisa Gorla
Elisa Gorla
FMFelice Manganiello
Felice Manganiello
JRJoachim Rosenthal
Joachim Rosenthal
In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size $k\times n$ with entries in a finite field $\mathbb F_q$. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires $\mathcal{O}((n-k)k^3)$ operations over an extension field $\mathbb F_{q^k}$. Our algorithm is more efficient than the previous ones in the literature, when the dimension $k$ of the codewords is small with respect to $n$. The decoding algorithm takes advantage of the algebraic structure of the code, and it uses original results on minors of a matrix and on the factorization of polynomials over finite fields.


20 April 2022 in Vietnam Journal of Mathematics
Verified
Journal Article
Open access
PDF file
ACAldo Conca
Aldo Conca
ENEmanuela De Negri
Emanuela De Negri
EGElisa Gorla
Elisa Gorla
In this paper, we survey the theory of Cartwright–Sturmfels ideals. These are $\mathbb {Z}^{n}$ ℤ n -graded ideals, whose multigraded generic initial ideal is radical. Cartwright–Sturmfels ideals have surprising properties, mostly stemming from the fact that their Hilbert scheme only contains one Borel-fixed point. This has consequences, e.g., on their universal Gröbner bases and on the family of their initial ideals. In this paper, we discuss several known classes of Cartwright–Sturmfels ideals and we find a new one. Among determinantal ideals of same-size minors of a matrix of variables and Schubert determinantal ideals, we are able to characterize those that are Cartwright–Sturmfels.