Listar IMAC_Articles por autoría "8f6be33c-c170-4ab0-8df8-0e347ea567e3"

Mostrando ítems 1-10 de 10

    • openAccess   Asymmetric Entanglement-Assisted Quantum Error-Correcting Codes and BCH Codes 

      Galindo, Carlos; Hernando, Fernando; Matsumoto, Ryutaroh; Ruano, Diego IEEE (2020-01-17)
      The concept of asymmetric entanglement-assisted quantum error-correcting code (asymmetric EAQECC) is introduced in this article. Codes of this type take advantage of the asymmetry in quantum errors since phase-shift errors ...

    • openAccess   Classical and Quantum Evaluation Codesat the Trace Roots 

      Galindo, Carlos; Hernando, Fernando; Ruano, Diego IEEE (2019-04)
      We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to ...

    • openAccess   Fast Algorithms for the Computation of the Minimum Distance of a Random Linear Code 

      Hernando, Fernando; Igual, Francisco; Quintana-Ortí, Gregorio Association for Computing Machinery (ACM) (2019-06)
      The minimum distance of an error-correcting code is an important concept in information theory. Hence, computing the minimum distance of a code with a minimum computational cost is crucial to many problems in this area. ...

    • openAccess   Locally recoverable J-affine variety codes 

      Galindo, Carlos; Hernando, Fernando; Munuera, Carlos (2020-06)
      A locally recoverable (LRC) code is a code over a finite eld Fq such that any erased coordinate of a codeword can be recovered from a small number of other coordinates in that codeword. We construct LRC codes correcting ...

    • openAccess   MDS, Hermitian almost MDS, and Gilbert–Varshamov quantum codes from generalized monomial-Cartesian codes 

      Barbero Lucas, Beatriz; Hernando, Fernando; Martín-Cruz, Helena; McGuire, Gary Springer Nature (2024-03-01)
      We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. ...

    • openAccess   New binary and ternary LCD codes 

      Galindo, Carlos; Geil, Olav; Hernando, Fernando; Ruano, Diego IEEE (2018-05-09)
      LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field ...

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

      Galindo, Carlos; Hernando, Fernando Springer (2022-03-21)
      Many q-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal q2-ary linear codes. This result can be generalized to q2m-ary linear codes, m>1. We give a result for easily obtaining quantum codes ...

    • openAccess   Optimal (r,δ)-LRCs from monomial-Cartesian codes and their subfield-subcodes 

      Galindo, Carlos; Hernando, Fernando; Martín-Cruz, Helena Springer (2024-05-02)
      We study monomial-Cartesian codes (MCCs) which can be regarded as (r,δ)-locally recoverable codes (LRCs). These codes come with a natural bound for their minimum distance and we determine those giving rise to (r,δ)-optimal ...

    • openAccess   Quasi-cyclic constructions of quantum codes 

      Galindo, Carlos; Hernando, Fernando; Matsumoto, Ryutaroh Elsevier (2018-07)
      We give sufficient conditions for self-orthogonality with respect to symplec- tic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic ...

    • openAccess   Stabilizer quantum codes defined by trace-depending polynomials 

      Galindo, Carlos; Hernando, Fernando; Martín-Cruz, Helena; Ruano, Diego Elsevier (2022-12-29)
      Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace [18]. In this paper, we propose to evaluate polynomials at the roots of trace-depending ...