Name
Abstract | ||
|---|---|---|
In this paper, we firstly study construction of new quantum error-correcting codes (QECCs) from three classes of quaternary imprimitive BCH codes. As a result, the improved maximal designed distance of these narrow-sense imprimitive Hermitian dual-containing quaternary BCH codes are determined to be much larger than the result given according to Aly et al. (IEEE Trans Inf Theory 53:1183---1188, 2007) for each different code length. Thus, families of new QECCs are newly obtained, and the constructed QECCs have larger distance than those in the previous literature. Secondly, we apply a combinatorial construction to the imprimitive BCH codes with their corresponding primitive counterpart and construct many new linear quantum codes with good parameters, some of which have parameters exceeding the finite Gilbert---Varshamov bound for linear quantum codes. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s11128-016-1397-6 | Quantum Information Processing |
Keywords | Field | DocType |
BCH code,Maximal designed distance,Quantum error-correcting code,Combinatorial construction,Finite Gilbert–Varshamov bound | Quantum,Discrete mathematics,Quantum mechanics,Block code,Polynomial code,Reed–Solomon error correction,BCH code,Linear code,Quantum convolutional code,MAXEkSAT,Physics | Journal |
Volume | Issue | ISSN |
15 | 10 | 1570-0755 |
Citations | PageRank | References |
1 | 0.35 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gen Xu | 1 | 1 | 1.03 |
| Ruihu Li | 2 | 34 | 6.11 |
| Luobin Guo | 3 | 14 | 4.00 |
| Yuena Ma | 4 | 5 | 1.12 |