On the distance of stabilizer quantum codes from \(J\)-affine variety codes
From MaRDI portal
Publication:2412656
DOI10.1007/s11128-017-1559-1zbMath1373.81163arXiv1610.07891OpenAlexW2539705156WikidataQ62582179 ScholiaQ62582179MaRDI QIDQ2412656
Fernando Hernando, Diego Ruano, Olav Geil, Carlos Galindo Pastor
Publication date: 24 October 2017
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.07891
subfield-subcodesHermitian and Euclidean dualitystabilizer \(J\)-affine variety codesdesigned minimum distance
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Quantum coding (general) (81P70)
Related Items
Quantum codes from a new construction of self-orthogonal algebraic geometry codes, Steane enlargement of entanglement-assisted quantum error-correcting codes, Generalized Hamming weights of toric codes over hypersimplices and squarefree affine evaluation codes, On subfield subcodes obtained from restricted evaluation codes, Two Gilbert-Varshamov-type existential bounds for asymmetric quantum error-correcting codes, Stabilizer quantum codes defined by trace-depending polynomials, Subfield subcodes of projective Reed-Muller codes, Entanglement-assisted quantum error-correcting codes from RS codes and BCH codes with extension degree 2, The Metric Structure of Linear Codes, Mutually unbiased property of special entangled bases, Locally recoverable \(J\)-affine variety codes, Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New \(q\)-ary quantum MDS codes with distances bigger than \(\frac{q}{2}\)
- Constructions of new families of nonbinary CSS codes
- Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
- New quantum codes from evaluation and matrix-product codes
- Weighted Reed-Muller codes revisited
- Roots and coefficients of multivariate polynomials over finite fields
- Quantum codes from affine variety codes and their subfield-subcodes
- Evaluation codes defined by finite families of plane valuations at infinity
- Feng-Rao decoding of primary codes
- Evaluation codes from order domain theory
- On the evaluation codes given by simple \(\delta \)-sequences
- Application of Constacyclic Codes to Quantum MDS Codes
- On the Construction of Nonbinary Quantum BCH Codes
- A Finite Gilbert–Varshamov Bound for Pure Stabilizer Quantum Codes
- Nonbinary Stabilizer Codes Over Finite Fields
- On Quantum and Classical BCH Codes
- Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
- δ-sequences and evaluation codes defined by plane valuations at infinity
- Quantum twisted codes
- Error Correcting Codes in Quantum Theory
- Quantum Error Correction and Orthogonal Geometry
- Enlargement of Calderbank-Shor-Steane quantum codes
- Quantum error detection .II. Bounds
- Quantum error detection .I. Statement of the problem
- Nonbinary quantum stabilizer codes
- Quantum error correction via codes over GF(4)
- Lower bound for the quantum capacity of a discrete memoryless quantum channel
- Ideals, Varieties, and Algorithms
- Application of Classical Hermitian Self-Orthogonal MDS Codes to Quantum MDS Codes
- All the Stabilizer Codes of Distance 3
- A single quantum cannot be cloned
- Polynomial weights and code constructions
- EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES
