activity
20202026
most citedAn algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance

9 citations · 18 across the 17 of their papers we have counts for

collaborators
Showing cs.ITShow all

13 papers · 1 filter

cs.IT2026

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…

cs.IT2025

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…

cs.IT2025

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…

cs.IT2025

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,…

cs.IT2025

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…

cs.IT2024

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…

cs.IT2024

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…

cs.IT2024★ 1 cited

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…

cs.IT2024

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…

cs.IT2023★ 9 cited

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,…

cs.IT2022★ 1 cited

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…

cs.IT2021

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…

cs.IT2021★ 6 cited

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…