## Bounds on the minimum distance of additive quantum codes

### Bounds on [[25,21]]_{2}

lower bound: | 2 |

upper bound: | 2 |

### Construction

Construction of a [[25,21,2]] quantum code:
[1]: [[24, 22, 2]] Quantum code over GF(2^2)
Distance two code
[2]: [[24, 21, 2]] Quantum code over GF(2^2)
Subcode of [1]
[3]: [[25, 21, 2]] Quantum code over GF(2^2)
ExtendCode [2] by 1
stabilizer matrix:
[1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0|0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0]
[0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0|0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0]
[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1|0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0]
[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0|1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0]
last modified: 2005-06-27

### Notes

- All codes establishing the lower bounds where constructed using MAGMA.
- Most upper bounds on qubit codes for
*n≤100* are based on a MAGMA program by Eric Rains.
- For
*n>100*, the upper bounds on qubit codes are weak (and not even monotone in *k*).
- Some additional information can be found in the book by Nebe, Rains, and Sloane.
- My apologies to all authors that have contributed codes to this table for not giving specific credits.

This page is maintained by
Markus Grassl
(grassl@ira.uka.de).
Last change: 23.10.2014