Name
Abstract | ||
|---|---|---|
A CSS quantum code is succinctly represented as a pair of linear codes $$(C_1 ,C_2^{\perp })$$ over finite fields $${\mathbb {F}}_{p^e}$$ with $$C_2^{\perp }\subset C_1$$, where p is a prime and e is a positive integer. In this paper, we present two criteria of the $$C_2^{\perp _s}\subset C_1$$ , where $$C_2^{\perp _s}$$ denotes the s-Galois dual of $$C_2$$ and $$0\le s <e$$. Then, using the two criteria, we construct some new quantum codes and a class of new quantum maximum-distance-separable (quantum MDS) codes. In addition, our obtained quantum MDS codes have parameters better than the ones available in the literature. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s11128-020-2575-0 | Quantum Information Processing |
Keywords | Field | DocType |
s-Galois dual code, Quantum MDS code, Rank of matrix | Prime (order theory),Integer,Discrete mathematics,Quantum,Quantum codes,Finite field,Quantum mechanics,Quantum computer,Physics | Journal |
Volume | Issue | ISSN |
19 | 3 | 1570-0755 |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiusheng Liu | 1 | 11 | 4.61 |
| Peng Hu | 2 | 38 | 12.24 |