Quantum codes from one-point codes on norm-trace curves
From MaRDI portal
Publication:2088960
DOI10.1007/s12095-022-00586-3zbMath1498.94104OpenAlexW4280612133WikidataQ114849109 ScholiaQ114849109MaRDI QIDQ2088960
Publication date: 6 October 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-022-00586-3
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Quantum coding (general) (81P70)
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum error-correcting codes from algebraic geometry codes of castle type
- Distance bounds for algebraic geometric codes
- On the order bounds for one-point AG codes
- On codes from norm-trace curves
- The minimum weights of two-point AG codes on norm-trace curves
- Good and asymptotically good quantum codes derived from algebraic geometry
- On the duals of geometric Goppa codes from norm-trace curves
- Computing Weierstrass semigroups and the Feng-Rao distance from singular plane models
- Intersections between the norm-trace curve and some low degree curves
- Construction of minimal linear codes from multi-variable functions
- A class of skew cyclic codes and application in quantum codes construction
- Classification of cyclic codes over a non-Galois chain ring \(\mathbb{Z}_p [u / \langle u^3 \rangle\)]
- Minimum-weight codewords of the Hermitian codes are supported on complete intersections
- Quantum codes from a new construction of self-orthogonal algebraic geometry codes
- One- and Two-Point Codes Over Kummer Extensions
- Some good quantum error-correcting codes from algebraic-geometric codes
- Quantum error correction via codes over GF(4)
