14 papers
Transversal gates for quantum CSS codes
Eduardo Camps-Moreno, Hiram H. López, Gretchen L. Matthews +2
In this paper, we focus on the problem of computing the set of diagonal transversal gates fixing a CSS code. We determine the logical actions of the gates as well as the groups of…
The permutation group of Reed-Solomon codes over arbitrary points
Eduardo Camps-Moreno, Jun Bo Lau, Hiram H. López +1
In this work, we prove that the permutation group of a Reed-Solomon code is given by the polynomials of degree one that leave the set of evaluation points invariant. Our results pr…
The Clifford defect of a numerical semigroup
Eduardo Camps-Moreno, Adrián Fidalgo-DÃaz, Umberto MartÃnez-Peñas +1
The Clifford defect is a rational number associated to the Weierstrass semigroup at a given point of an algebraic curve. It describes the error-correcting capability of the so-call…
Analytic spread of binomial edge ideals
Eduardo Camps-Moreno, Deblina Dey, Souvik Dey +5
We investigate the analytic spread of binomial edge ideals of finite simple graphs. We provide tight bounds for this invariant in general. For special families of graphs (e.g., clo…
Code distances: a new family of invariants of linear codes
Eduardo Camps-Moreno, Elisa Gorla, Hiram H. López
In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are…
Bounds and MacWilliams Identities for codes over Artinian rings
Eduardo Camps-Moreno, Carlos Espinosa-Valdéz, Hiram H. López +2
This work develops new foundations for the theory of linear codes over local Artinian commutative rings. We use algebraic invariants such as the socle, type, length, and minimal nu…