2017
DOI: 10.1007/s11128-017-1618-7
|View full text |Cite
|
Sign up to set email alerts
|

Good and asymptotically good quantum codes derived from algebraic geometry

Abstract: In this paper, we construct several new families of quantum codes with good parameters. These new quantum codes are derived from (classical) t-point (t ≥ 1) algebraic geometry (AG) codes by applying the Calderbank-Shor-Steane (CSS) construction. More precisely, we construct two classical AG codes C1 and C2 such that C1 ⊂ C2, applying after the well-known CSS construction to C1 and C2. Many of these new codes have large minimum distances when compared with their code lengths as well as they also have small Sing… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
26
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 22 publications
(26 citation statements)
references
References 27 publications
0
26
0
Order By: Relevance
“…In this section we construct quantum codes from families of one-point AG codes onS q , using the so-called CSS construction which allows to construct quantum codes from classical linear codes; see [32,Lemma 2.5]. Let q be a prime power and H = (C q ) ⊗n = C q ⊗· · ·⊗C q be a q n -dimensional Hilbert space.…”
Section: Quantum Codes Froms Qmentioning
confidence: 99%
See 1 more Smart Citation
“…In this section we construct quantum codes from families of one-point AG codes onS q , using the so-called CSS construction which allows to construct quantum codes from classical linear codes; see [32,Lemma 2.5]. Let q be a prime power and H = (C q ) ⊗n = C q ⊗· · ·⊗C q be a q n -dimensional Hilbert space.…”
Section: Quantum Codes Froms Qmentioning
confidence: 99%
“…As an application of Lemma 5.1 to AG codes, La Guardia and Pereira proposed in [32] the following general t-point construction.…”
Section: Quantum Codes Froms Qmentioning
confidence: 99%
“…In this section we use families of one-point AG codes from the GGS curve to construct quantum codes. The main ingredient is the so called CSS contruction which enables to construct quantum codes from classical linear codes; see [29,Lemma 2.5].…”
Section: Quantum Codes From One-point Ag Codes On the Ggs Curvesmentioning
confidence: 99%
“…If δ Q = 0, then the code is said to be quantum MDS. For a detailed introduction on quantum codes see [29] and the references therein. Lemma 6.1.…”
Section: Quantum Codes From One-point Ag Codes On the Ggs Curvesmentioning
confidence: 99%
“…[17, Lemma 2.5] Let C 1 and C 2 be two linear codes with parameters[N, k i , d i ] q , i = 1, 2, and assume that C 1 ⊂ C 2 . Then there exists an [[N, k 2 − k 1 , D]] q -code with D = min{wt(c)|c ∈ (C 2 \ C 1 ) ∪ (C ⊥ 1 \ C ⊥ 2 )}, where wt(c) is the weight of c.…”
mentioning
confidence: 99%