Eduardo Camps-Moreno

Eduardo Camps-Moreno

Auto-generated profile, based on publicly available information

Eduardo Camps-Moreno

Department of Mathematics, Virginia Tech, Blacksburg, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 March 2024 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SASarah E. Anderson
Sarah E. Anderson
ECEduardo Camps-Moreno
Eduardo Camps-Moreno
HLHiram H. López
Hiram H. López
GMGretchen Matthews
Gretchen Matthews
DRDiego Ruano
Diego Ruano
ISIvan Soprunov
Ivan Soprunov
Given two $q$ -ary codes $C_{1}$ and $C_{2}$ , the relative hull of $C_{1}$ with respect to $C_{2}$ is the intersection $C_{1}\cap C_{2}^{\perp} $ . We prove that when $q>2$ , the relative hull dimension can be repeatedly reduced by one, down to a certain bound, by replacing either of the two codes with an equivalent one. The reduction of the relative hull dimension applies to hulls taken with respect to the $e$ -Galois inner product, which has as special cases both the Euclidean and Hermitian inner products. We give conditions under which the relative hull dimension can be increased by one via equivalent codes when $q>2$ . We study some consequences of the relative hull properties on entanglement-assisted quantum error-correcting codes and prove the existence of new entanglement-assisted quantum error-correcting maximum distance separable codes, meaning those whose parameters satisfy the quantum Singleton bound.

2 March 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ECEduardo Camps-Moreno
Eduardo Camps-Moreno
EGElisa Gorla
Elisa Gorla
CLCristina Landolina
Cristina Landolina
EGElisa Lorenzo Garcia
Elisa Lorenzo Garcia
UMUmberto Martinez-Penas
Umberto Martinez-Penas
FSFlavio Salizzoni
Flavio Salizzoni
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.

28 December 2020 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ECEduardo Camps
Eduardo Camps
HLHiram H. López
Hiram H. López
GMGretchen Matthews
Gretchen Matthews
ESEliseo Sarmiento
Eliseo Sarmiento
In this article, we introduce a new family of polar codes from evaluation codes, called polar decreasing monomial-Cartesian codes, and prove that families of polar codes with multiple kernels over certain symmetric channels can be viewed as polar decreasing monomial-Cartesian codes. This offers a unified treatment for such codes over any finite field. We define decreasing monomial-Cartesian codes as evaluation codes obtained from a set of monomials closed under divisibility over a Cartesian product and determine their parameters (length, dimension, and minimum distance). We show that the dual of a decreasing monomial-Cartesian code is monomially equivalent to a decreasing monomial-Cartesian code. Polar decreasing monomial-Cartesian codes are then obtained by utilizing decreasing monomial-Cartesian codes whose sets of monomials are closed with respect to a partial order. We prove that any sequence of invertible matrices over an arbitrary field satisfying certain conditions polarizes any channel that is symmetric over the field.

1 July 2018 in Finite Fields and Their Applications
Verified
Journal Article
Closed access
MSManuel González Sarabia
Manuel González Sarabia
ECEduardo Camps
Eduardo Camps
EREliseo Sarmiento Rosales
Eliseo Sarmiento Rosales
RVRafael H Villarreal
Rafael H Villarreal

6 June 2024 in Quantum Information Processing
Verified
Journal Article
Open access
PDF file
ECEduardo Camps-Moreno
Eduardo Camps-Moreno
HLHiram H. López
Hiram H. López
GMGretchen Matthews
Gretchen Matthews
DRDiego Ruano
Diego Ruano
RSRodrigo San-José
Rodrigo San-José
ISIvan Soprunov
Ivan Soprunov
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, C_2)$$ ( C 1 , C 2 ) such that $$C_1$$ C 1 contains $$C_2$$ C 2 , $$C_2$$ C 2 is even, and the shortening of the dual of $$C_1$$ C 1 with respect to the support of each codeword of $$C_2$$ C 2 is self-dual. In this paper, we give new conditions to guarantee that a pair of binary codes $$(C_1, C_2)$$ ( C 1 , C 2 ) is a CSS-T pair. We define the poset of CSS-T pairs and determine the minimal and maximal elements of the poset. We provide a propagation rule for nondegenerate CSS-T codes. We apply some main results to Reed–Muller, cyclic and extended cyclic codes. We characterize CSS-T pairs of cyclic codes in terms of the defining cyclotomic cosets. We find cyclic and extended cyclic codes to obtain quantum codes with better parameters than those in the literature.

14 October 2023 in Journal of Algebra and Its Applications
Verified
Journal Article
Closed access
ECEduardo Camps-Moreno
Eduardo Camps-Moreno
Ignacio García MarcosIgnacio García Marcos
Ignacio García Marcos
HLHiram H. López
Hiram H. López
ICIrene Márquez Corbella
Irene Márquez Corbella
EMEdgar Martínez-Moro
Edgar Martínez-Moro
EREliseo Sarmiento Rosales
Eliseo Sarmiento Rosales