2022
DOI: 10.1007/s10623-022-01018-2
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: Many q-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal $$q^2$$ q 2 -ary linear codes. This result can be generalized to $$q^{2 m}$$ q 2 m -ary linear codes, $$m > 1$$ m > 1 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 42 publications
0
3
0
Order By: Relevance
“…in [22,23,24,25,25,26,27,28,29,30,31,32,33,34,35,45]. For other researches on the construction of Hermitian self-orthogonal codes from cyclic codes, constacyclic codes, negacyclic codes, graph theory and so on, we refer to [36,37,38,39,40].…”
Section: Et Al Constructed Mds Codes With Arbitrary-dimensional E-gal...mentioning
confidence: 99%
“…in [22,23,24,25,25,26,27,28,29,30,31,32,33,34,35,45]. For other researches on the construction of Hermitian self-orthogonal codes from cyclic codes, constacyclic codes, negacyclic codes, graph theory and so on, we refer to [36,37,38,39,40].…”
Section: Et Al Constructed Mds Codes With Arbitrary-dimensional E-gal...mentioning
confidence: 99%
“…This implies that it truncates to codes equivalent to Hermitian self-orthogonal codes of length 9, 12 and 15 and one can check that these codes are a [9,4] It was proven in [3] that a [9,4,6] 9 MDS code does not come from a truncation of a generalised Reed-Solomon code. The only [9,4,6] 9 code which is not the truncation of a generalised Reed-Solomon code is the projection of Glynn's [10,5,6] 9 MDS code, see [6].…”
Section: Hermitian Self-orthogonal Codesmentioning
confidence: 99%
“…Many of these codes satisfy K = q k , for some nonnegative integer k, and then their parameters are expressed as [[n, k, d]] q ; abusing the notation we say that k is the dimension of these codes. QECCs were first introduced in the binary case [10,22,9,4,5] and later in the general case [7,3,30,1,32,11,17,18], where we have cited only some references of a vast literature on the subject. QECCs in the nonbinary case are convenient for fault-tolerant quantum computation [43,31,23,36].…”
Section: Introductionmentioning
confidence: 99%