2019
DOI: 10.1109/access.2019.2899383
|View full text |Cite
|
Sign up to set email alerts
|

New Non-Binary Quantum Codes Derived From a Class of Linear Codes

Abstract: In this short paper, we consider the non-binary quantum codes construction from a class of linear codes, which are not self-orthogonal over finite fields. As the computational results, new quantum codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
3
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…The code bounds such as Hamming bound and quantum Singleton bound for high-dimensional cases were analyzed in [40]. Various quantum codes can be generalized to the nonbinary cases, such as nonbinary quantum cyclic codes constructed using graph method [41], nonbinary codeword stabilized quantum codes with nonadditive properties [42], or nonbinary entanglement-assisted quantum codes [43].…”
Section: ) Nonbinary Quantum Codesmentioning
confidence: 99%
“…The code bounds such as Hamming bound and quantum Singleton bound for high-dimensional cases were analyzed in [40]. Various quantum codes can be generalized to the nonbinary cases, such as nonbinary quantum cyclic codes constructed using graph method [41], nonbinary codeword stabilized quantum codes with nonadditive properties [42], or nonbinary entanglement-assisted quantum codes [43].…”
Section: ) Nonbinary Quantum Codesmentioning
confidence: 99%
“…Then, Ashikhmin et al [2] generalized these results to non-binary case . Afterwards, many good QECCs have been constructed by using classical linear codes over finite fields [1,9,12,16,18,25,27,34,38]. Another important discovery in the quantum errorcorrecting area was the entanglement-assisted quantum codes (EAQECCs, for short).…”
Section: Introductionmentioning
confidence: 99%
“…In fact, extended constructions can also be utilized to construct QECCs and EAQECCs. In [34], Tonchev presented doubling extended constructions and obtained a new optimal binary [ [28,12,6]] QECC, which improved the corresponding lower bounds on minimum distance at that time. In 2018, Guenda et al [14] applied extended constructions to design families of EAQECCs with good error-correcting performance requiring desirable amounts of entanglement.…”
Section: Introductionmentioning
confidence: 99%
“…In 2001, Ashikhmin et al generalized these results to non-binary case in [5]. Afterwards, many good quantum codes have been constructed by using classical linear codes over finite fields [6]- [10].…”
Section: Introductionmentioning
confidence: 99%