activity
20072023
most citedEntanglement-assisted quantum error-correcting codes over arbitrary finite fields

107 citations · 433 across the 28 of their papers we have counts for

collaborators

31 papers

cs.IT2023

Steane enlargement of Entanglement-Assisted Quantum Error-Correcting Codes

Carlos Galindo, Fernando Hernando, Ryutaroh Matsumoto

We introduce a Steane-like enlargement procedure for entanglement-assisted quantum error-correcting codes (EAQECCs) obtained by considering Euclidean inner product. We give formula…

math.AG2022★ 1 cited

On the valuative Nagata conjecture

Carlos Galindo, Francisco Monserrat, Carlos-Jesús Moreno-Ávila +1

We provide several equivalent conditions for a plane divisorial valuation of a smooth projective surface to be minimal with respect to an ample divisor. These conditions involve a…

cs.IT2022★ 4 cited

Stabilizer quantum codes defined by trace-depending polynomials

Carlos Galindo, Fernando Hernando, Helena Martín-Cruz +1

Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace. In this paper, we propose to evaluate polynom…

cs.IT2022★ 4 cited

Optimal -LRCs from monomial-Cartesian codes and their subfield-subcodes

Carlos Galindo, Fernando Hernando, Helena Martín-Cruz

We study monomial-Cartesian codes (MCCs) which can be regarded as -locally recoverable codes (LRCs). These codes come with a natural bound for their minimum distance and we…

math.AG2021★ 2 cited

On the degree of curves with prescribed multiplicities and bounded negativity

Carlos Galindo, Francisco Monserrat, Carlos-Jesús Moreno-Ávila +1

We provide a lower bound on the degree of curves of the projective plane passing through the centers of a divisorial valuation of with prescribed…

cs.IT2020★ 8 cited

On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes

Carlos Galindo, Fernando Hernando

Many -ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal -ary linear codes. This result can be generalized to -ary linear codes, $m > 1…