Name
Abstract | ||
|---|---|---|
In this paper, a family of new entanglement-assisted quantum error-correcting codes (EAQECCs) is constructed from constacyclic codes with length n = q(2)+1/a by giving a new method to select defining sets, where a = m(2) + 1, m > 2 is even and q is an odd prime power with a vertical bar (q +/- m). It is worth pointing out that those EAQECCs are entanglement-assisted quantum maximum distance separable (EAQMDS) codes when d <= n+2/2. All of them are new in the sense that their parameters are not covered by the previously known ones. Moreover, they have minimum distance larger than q + 1. Compared with the codes with the same length listed in Table 1, our codes have larger minimum distance. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s10623-021-00908-1 | DESIGNS CODES AND CRYPTOGRAPHY |
Keywords | DocType | Volume |
EAQECCs, EAQMDS codes, Constacyclic codes, Defining set | Journal | 89 |
Issue | ISSN | Citations |
9 | 0925-1022 | 1 |
PageRank | References | Authors |
0.35 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaojing Chen | 1 | 34 | 8.09 |
| Shixin Zhu | 2 | 216 | 37.61 |
| Jiang Wan | 3 | 2 | 1.38 |
| Gaojun Luo | 4 | 18 | 7.99 |