arXiv subjects

Elisa Gorla

Publications and source records attributed to Elisa Gorla.

At least 37 records · Page 2Linked to original sources

arXiv2022

Quasi optimal anticodes: structure and invariants

It is well-known that the dimension of optimal anticodes in the rank-metric is divisible by the maximum m between the number of rows and columns of the matrices. Moreover, for a fixed k divisible by m, optimal rank-metric anticodes are the codes with least maximum rank, among those of dimension k. In this paper, we study the family of rank-metric codes whose dimension is not divisible by m and whose maximum rank is the least possible for codes of that dimension, according to the Anticode bound. As these are not optimal anticodes, we call them quasi optimal anticodes (qOACs). In addition, we call dually qOAC a qOAC whose dual is also a qOAC. We describe explicitly the structure of dually qOACs and compute their weight distributions, generalized weights, and associated q-polymatroids.

cs.IT↗

arXiv2022

Generalized weights of codes over rings and invariants of monomial ideals

We develop an algebraic theory of supports for $R$-linear codes of fixed length, where $R$ is a finite commutative unitary ring. A support naturally induces a notion of generalized weights and allows one to associate a monomial ideal to a code. Our main result states that, under suitable assumptions, the generalized weights of a code can be obtained from the graded Betti numbers of its associated monomial ideal. In the case of $\mathbb{F}_q$-linear codes endowed with the Hamming metric, the ideal coincides with the Stanley-Reisner ideal of the matroid associated to the code via its parity-check matrix. In this special setting, we recover the known result that the generalized weights of an $\mathbb{F}_q$-linear code can be obtained from the graded Betti numbers of the ideal of the matroid associated to the code. We also study subcodes and codewords of minimal support in a code, proving that a large class of $R$-linear codes is generated by its codewords of minimal support.

cs.IT↗

arXiv2021

Optimal anticodes, MSRD codes, and generalized weights in the sum-rank metric

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.

cs.IT↗

arXiv2021

Cartwright-Sturmfels ideals associated to graphs and linear spaces

Inspired by work of Cartwright and Sturmfels, in a previous paper we introduced two classes of multigraded ideals named after them. These ideals are defined in terms of properties of their multigraded generic initial ideals. The goal of this paper is showing that three families of ideals that have recently attracted the attention of researchers are Cartwright-Sturmfels ideals. More specifically, we prove that binomial edge ideals, multigraded homogenizations of linear spaces, and multiview ideals are Cartwright-Sturmfels ideals, hence recovering and extending recent results of Herzog-Hibi-Hreinsdottir-Kahle-Rauh, Ohtani, Ardila-Boocher, Aholt-Sturmfels-Thomas, and Binglin Li. We also propose a conjecture on the rigidity of local cohomology modules of Cartwright-Sturmfels ideals, that was inspired by a theorem of Brion. We provide some evidence for the conjecture by proving it in the monomial case.

math.AC↗

arXiv2021

Rees algebras of sparse determinantal ideals

We determine the defining equations of the Rees algebra and of the special fiber ring of the ideal of maximal minors of a $2\times n$ sparse matrix. We prove that their initial algebras are ladder determinantal rings. This allows us to show that the Rees algebra and the special fiber ring are Cohen-Macaulay domains, they are Koszul, they have rational singularities in characteristic zero and are F-rational in positive characteristic.

math.AC↗

arXiv2020

Stronger bounds on the cost of computing Groebner bases for HFE systems

We give upper bounds for the solving degree and the last fall degree of the polynomial system associated to the HFE (Hidden Field Equations) cryptosystem. Our bounds improve the known bounds for this type of systems. We also present new results on the connection between the solving degree and the last fall degree and prove that, in some cases, the solving degree is independent of coordinate changes.

cs.CR↗

arXiv2019

Computing the dimension of ideals in group algebras, with an application to coding theory

The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right representation of G; in particular, when F[G] is semisimple, the dimension of a principal ideal is equal to the rank of the matrix representing a generator. From this observation, a bound and an efficient algorithm to compute the dimension of an ideal in a group ring are established. Since group codes are ideals in finite group rings, the algorithm allows efficient computation of their dimension.

cs.IT↗

arXiv2019

Rank-Metric Codes and $q$-Polymatroids

This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of q-polymatroids to a rank-metric codes and show that several invariants and structural properties of the code, such as generalized weights, the property of being MRD or an optimal anticode, and duality, are captured by the associated combinatorial object.

cs.IT↗

arXiv2019

Rank-metric codes

This is a chapter of the upcoming "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and P. Sole' Eds., CRC Press. The chapter gives an introduction to the mathematical theory of rank-metric codes. Treated topics include: definition of rank metric, equivalence of codes, support of a codeword and of a code, duality, weight enumerators and MacWilliams identities, higher rank weights, MRD codes, optimal anticodes, and q-polymatroids associated to a rank-metric code.

cs.IT↗

arXiv2017

Gorenstein liaison for toric ideals of graphs

A central question in liaison theory asks whether every Cohen-Macaulay, graded ideal of a standard graded K-algebra belongs to the same G-liaison class of a complete intersection. In this paper we answer this question positively for toric ideals defining edge subrings of bipartite graphs.

math.AG↗

arXiv2017

Codes Endowed With the Rank Metric

We review the main results of the theory of rank-metric codes, with emphasis on their combinatorial properties. We study their duality theory and MacWilliams identities, comparing in particular rank-metric codes in vector and matrix representation. We then investigate the combinatorial structure of MRD codes and optimal anticodes in the rank metric, describing how they relate to each other.

cs.IT↗

arXiv2017

Scalar multiplication in compressed coordinates in the trace-zero subgroup

We consider trace-zero subgroups of elliptic curves over a degree three field extension. The elements of these groups can be represented in compressed coordinates, i.e. via the two coefficients of the line that passes through the point and its two Frobenius conjugates. In this paper we give the first algorithm to compute scalar multiplication in the degree three trace-zero subgroup using these coordinates.

cs.CR↗

arXiv2016

An algebraic framework for end-to-end physical-layer network coding

We propose an algebraic setup for end-to-end physical-layer network coding based on submodule transmission. We introduce a distance function between modules, describe how it relates to information loss and errors, and show how to compute it. Then we propose a definition of submodule error-correcting code, and investigate bounds and constructions for such codes.

cs.IT↗

arXiv2016

Universal Groebner bases and Cartwright-Sturmfels ideals

We describe the universal Groebner basis of the ideal of maximal minors and the ideal of $2$-minors of a multigraded matrix of linear forms. Our results imply that the ideals are radical and provide bounds on the regularity. In particular, the ideals of maximal minors have linear resolutions. Our main theoretical contribution consists of introducing two new classes of ideals named after Cartwright and Sturmfels, and proving that they are closed under multigraded hyperplane sections. The gins of the ideals that we study enjoy special properties.

math.AC↗

arXiv2016

Multigraded generic initial ideals of determinantal ideals

Let I be either the ideal of maximal minors or the ideal of 2-minors of a row graded or column graded matrix of linear forms L. In two previous papers we showed that I is a Cartwright-Sturmfels ideal, that is, the multigraded generic initial ideal gin(I) of I is radical (and essentially independent of the term order chosen). In this paper we describe generators and prime decomposition of gin(I) in terms of data related to the linear dependences among the row or columns of the submatrices of L. In the case of 2-minors we also give a closed formula for its multigraded Hilbert series.

math.AC↗

arXiv2016

An optimal representation for the trace zero subgroup

We give an optimal-size representation for the elements of the trace zero subgroup of the Picard group of an elliptic or hyperelliptic curve of any genus, with respect to a field extension of any prime degree. The representation is via the coefficients of a rational function, and it is compatible with scalar multiplication of points. We provide efficient compression and decompression algorithms, and complement them with implementation results. We discuss in detail the practically relevant cases of small genus and extension degree, and compare with the other known compression methods.

cs.CR↗

arXiv2015

Rank distribution of Delsarte codes

In analogy with the Singleton defect for classical codes, we propose a definition of rank defect for Delsarte rank-metric codes. We characterize codes whose rank defect and dual rank defect are both zero, and prove that the rank distribution of such codes is determined by their parameters. This extends a result by Delsarte on the rank distribution of MRD codes. In the general case of codes of positive defect, we show that the rank distribution is determined by the parameters of the code, together the number of codewords of small rank. Moreover, we prove that if the rank defect of a code and its dual are both one, and the dimension satisfies a divisibility condition, then the number of minimum-rank codewords and dual minimum-rank codewords is the same. Finally, we discuss how our results specialize to Gabidulin codes.

cs.IT↗

arXiv2015

Compression for trace zero points on twisted Edwards curves

We propose two optimal representations for the elements of trace zero subgroups of twisted Edwards curves. For both representations, we provide efficient compression and decompression algorithms. The efficiency of the algorithm is compared with the efficiency of similar algorithms on elliptic curves in Weierstrass form.

math.NT↗