Name
Abstract | ||
|---|---|---|
In 2001, Blackmore and Norton introduced an important tool called matrix-product codes, which turn out to be very useful to construct new quantum codes of large lengths. To obtain new and good quantum codes, we first give a general approach to construct matrix-product codes being Hermitian dual-containing and then provide the constructions of such codes in the case s|(q2-1), where s is the number of the constituent codes in a matrix-product code. For s|(q+1), we construct such codes with lengths more flexible than the known ones in the literature. For s|(q2-1) and s inverted iota (q+1), such codes are constructed in an unusual manner; some of the constituent codes therein are not required to be Hermitian dual-containing. Accordingly, by Hermitian construction, we present two procedures for acquiring quantum codes. Finally, we list some good quantum codes, many of which improve those available in the literature or add new parameters. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s11128-020-02921-0 | QUANTUM INFORMATION PROCESSING |
Keywords | DocType | Volume |
Hermitian dual-containing codes, Matrix-product codes, Generalized Reed-Solomon codes, Extended generalized Reed-Solomon codes, Quantum codes | Journal | 19 |
Issue | ISSN | Citations |
12 | 1570-0755 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Meng Cao | 1 | 0 | 0.68 |
| Jianlian Cui | 2 | 1 | 1.38 |