9 citations · 18 across the 17 of their papers we have counts for
20 papers
Polynomials with restricted support and maximal zeros on a finite Cartesian set
Dipak K. Bhunia, Eduardo Camps-Moreno, Ignacio GarcÍa-Marco +2
Given a finite Cartesian set and a decreasing set of monomials , we call extremal polynomials for over those that have the maximum numbe…
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…
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…
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…
Duals of multiplicity codes
Eduardo Camps Moreno, Adrián Fidalgo-Díaz, Hiram H. López +3
Multivariate multiplicity codes have been recently explored because of their importance for list decoding and local decoding. Given a multivariate multiplicity code, in this paper,…
On decoding hyperbolic codes
Eduardo Camps-Moreno, Ignacio García-Marco, Hiram H. López +3
This work studies several decoding algorithms for hyperbolic codes. We use some previous ideas to describe how to decode a hyperbolic code using the largest Reed-Muller code contai…
The weight hierarchy of decreasing norm-trace codes
Eduardo Camps-Moreno, Hiram H. López, Gretchen L. Matthews +1
The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the w…
Binary Triorthogonal and CSS-T Codes for Quantum Error Correction
Eduardo Camps-Moreno, Hiram H. López, Gretchen L. Matthews +3
In this paper, we study binary triorthogonal codes and their relation to CSS-T quantum codes. We characterize the binary triorthogonal codes that are minimal or maximal with respec…
Toward Quantum CSS-T Codes from Sparse Matrices
Eduardo Camps-Moreno, Hiram H. López, Gretchen L. Matthews +1
CSS-T codes were recently introduced as quantum error-correcting codes that respect a transversal gate. A CSS-T code depends on a pair of binary linear codes and…
On the affine permutation group of certain decreasing Cartesian codes
Eduardo Camps-Moreno, Hiram H. López, Eliseo Sarmiento +1
A decreasing Cartesian code is defined by evaluating a monomial set closed under divisibility on a Cartesian set. Some well-known examples are the Reed-Solomon, Reed-Muller, and (s…
Fractional decoding of algebraic geometry codes over extension fields
Eduardo Camps-Moreno, Gretchen L. Matthews, Welington Santos
In this paper, we study algebraic geometry codes from curves over through their virtual projections which are algebraic geometric codes over . W…
The minimum distance of a parameterized code over an even cycle
Eduardo Camps-Moreno, Jorge Neves, Eliseo Sarmiento
We compute the minimum distance of the parameterized code of order 1 over an even cycle.
An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance
Eduardo Camps-Moreno, Hiram H. López, Gretchen L. Matthews +3
CSS-T codes were recently introduced as quantum error-correcting codes that respect a transversal gate. A CSS-T code depends on a CSS-T pair, which is a pair of binary codes $(C_1,…
Relative hulls and quantum codes
Sarah E. Anderson, Eduardo Camps-Moreno, Hiram H. López +3
Given two -ary codes and , the relative hull of with respect to is the intersection . We prove that when , the relative hull dimen…
Optimal anticodes, MSRD codes, and generalized weights in the sum-rank metric
Eduardo Camps Moreno, Elisa Gorla, Cristina Landolina +3
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 ge…
On the generalized Hamming weights of hyperbolic codes
Eduardo Camps-Moreno, Ignacio García-Marco, Hiram H. López +3
A hyperbolic code is an evaluation code that improves a Reed-Muller because the dimension increases while the minimum distance is not penalized. We give the necessary and sufficien…
Powers of Principal -Borel ideals
Eduardo Camps Moreno, Craig Kohne, Eliseo Sarmiento +1
Fix a poset on . A -Borel monomial ideal is a monomial ideal whose monomials are closed under the Borel-like mov…