Abstract
For (n,d)=(66,17),(78,19) and (94,21), we construct quantum [[n,0,d]] codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from self-dual additive F4-codes based on pairs of circulant matrices.
Original language | English |
---|---|
Pages (from-to) | 35-38 |
Number of pages | 4 |
Journal | Information Processing Letters |
Volume | 138 |
DOIs | |
Publication status | Published - 2018 Oct |
Externally published | Yes |
Keywords
- Combinatorial problem
- Minimum weight
- Quantum code
- Self-dual additive F-code
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications