Name
Abstract | ||
|---|---|---|
Entanglement-assisted quantum error-correcting (EAQEC) codes can be transformed from classical linear codes through entanglement-assisted formalism by loosing the dual-containing condition and using pre-shared entanglement. It has become a challenging task to construct optimal EAQEC codes and determine the required number of pre-shared entanglement pairs. In this work, we explore the structure of
$$q^2$$
-ary cyclic codes through analyzing two classes of cyclotomic cosets independently. By computing the number of maximally entangled states, we construct three classes of q-ary entanglement-assisted quantum maximum distance separable (EAQMDS) codes. This construction produces new EAQMDS codes with minimum distance more than
$$q+1$$
. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/s11128-022-03547-0 | Quantum Information Processing |
Keywords | DocType | Volume |
Cyclic code, Defining set, EAQEC code, Cyclotomic coset | Journal | 21 |
Issue | ISSN | Citations |
6 | 1573-1332 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongmei Lu | 1 | 0 | 0.34 |
| Xiaoshan Kai | 2 | 50 | 4.29 |
| Shixin Zhu | 3 | 1 | 2.05 |