Bounds on the minimum distance of additive quantum codes

Bounds on [[41,22]]2

lower bound:5
upper bound:7

Construction

Construction of a [[41,22,5]] quantum code:
[1]:  [[41, 21, 6]] quantum code over GF(2^2)
     cyclic code of length 41 with generating polynomial w^2*x^40 + x^39 + w*x^38 + x^37 + w^2*x^35 + x^34 + w^2*x^33 + x^32 + x^31 + x^29 + w*x^28 + w*x^27 + w^2*x^26 + w^2*x^25 + w*x^24 + w*x^23 + x^22 + x^20 + x^19 + w^2*x^18 + x^17 + w^2*x^16 + x^14 + w*x^13 + x^12 + w^2*x^11 + x^10 + 1
[2]:  [[40, 22, 5]] quantum code over GF(2^2)
     Shortening of the stabilizer code of [1] at { 41 }
[3]:  [[41, 22, 5]] quantum code over GF(2^2)
     ExtendCode [2] by 1

    stabilizer matrix:

      [1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 1 1 1 1 0 0 0 1 0 0|0 1 0 0 0 1 1 0 1 0 0 1 0 1 1 0 0 0 1 0 0 0 0 1 0 1 1 0 1 0 0 0 1 0 1 1 0 1 0 0 0]
      [0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 1 1 1 1 0 0 0 1 0|0 0 1 0 0 0 1 1 0 1 0 0 1 0 1 1 0 0 0 1 0 0 0 0 1 0 1 1 0 1 0 0 0 1 0 1 1 0 1 0 0]
      [0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 1 1 0 0 0 1 1 1 0 1 1 0|0 1 1 0 1 0 1 0 1 0 1 1 1 1 1 0 0 1 0 0 1 0 0 1 1 1 1 0 1 0 1 0 1 1 1 1 0 1 0 1 0]
      [0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 0 0 0 1 0 0 0 1 1 0 1 1 1 0 1 0 1 1 1 0|0 1 0 1 0 1 0 0 0 0 0 1 1 1 0 0 0 1 1 0 0 0 0 0 1 1 1 0 0 1 1 1 0 1 1 1 0 0 1 0 0]
      [0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 1 1 1 0 1 0 0 1 0 1 1 1 1 0|1 0 1 0 0 1 1 1 0 0 1 0 0 0 1 0 0 1 1 1 0 0 1 0 1 0 1 0 0 0 1 0 1 1 0 1 0 0 0 1 0]
      [0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 1 1 0 0 0 0 0 0 0 1 0 1 1 1 0 1 0|0 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 0 1 1 1 1 1 0 1 0 1 0 0 0 0 1 1 0 1 1 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 1 1 0 0 0 0 0 1 1 0 1 1 1 1 1 0 1 0 1 0 0|1 0 0 1 0 1 0 0 0 1 0 0 0 1 0 1 0 1 1 1 1 1 0 0 0 1 1 1 0 0 0 0 1 1 0 1 1 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 1 1 0 0 0 0 0 1 1 0 1 1 1 1 1 0 1 0 1 0|0 1 0 0 1 0 1 0 0 0 1 0 0 0 1 0 1 0 1 1 1 1 1 0 0 0 1 1 1 0 0 0 0 1 1 0 1 1 0 0 0]
      [0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 1 0 1 1 1 1 1 0 1 1 1 0 0 1 0|0 1 0 1 1 1 1 0 0 0 0 0 1 0 1 0 1 0 0 1 1 1 1 0 1 0 1 0 1 1 0 0 1 1 1 0 1 1 1 0 0]
      [0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 1 1 1 0 1 1 1 1 1 0 1 0 0 1 1 1 1 1 0|0 1 0 1 0 1 0 0 0 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 1 1 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0]
      [0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 1 1 1 0 1 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 1 0|0 1 0 0 1 0 1 1 0 1 0 0 1 1 0 0 0 0 0 0 0 0 1 1 0 1 1 0 0 0 0 1 0 1 0 1 1 1 1 1 0]
      [0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 1 1 0 0 1 0 0 0 1 1 1 1 0|1 0 1 1 0 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 0 1 1 0 1 1 0 0 0 0 1 1 0 0 0 1 0 1 1 1 0]
      [0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 1 1 0 1 1 0 0 0 1 0 1 0 0 0 0 0 1 0 1 0 0|1 1 0 0 1 1 1 0 0 0 0 1 1 1 0 1 1 0 1 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0 0 1 1 0]
      [0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 1 0 1 1 0|1 0 0 0 1 0 1 1 0 1 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 1 0 0 1 0 1 0 0 1 1 1 1 0 0 1 0]
      [0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 1 1 1 1 0 0 0 1 0 0 1 0 0 0 0|1 1 0 1 0 0 1 0 1 1 0 0 0 1 0 0 0 0 1 0 1 1 0 1 0 0 0 1 0 1 1 0 1 0 0 0 0 1 0 0 0]
      [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 1 0 1 1 1 0 0 0 1 1 0 0 1 0 1 0 0 0 1 1 0|1 0 0 1 1 1 1 1 0 1 0 1 0 1 0 1 1 0 0 1 0 1 0 1 1 1 1 0 1 0 1 0 1 1 1 1 0 0 1 0 0]
      [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 1 1 1 1 0 0 0 1 0 0 1 0 0|0 0 1 1 0 1 0 0 1 0 1 1 0 0 0 1 0 0 0 0 1 0 1 1 0 1 0 0 0 1 0 1 1 0 1 0 0 0 0 1 0]
      [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 1 0 1 0 0 1 0 1 0 0 0 0 1 1 1 0|1 1 1 1 0 1 1 0 0 0 1 1 0 1 1 1 1 0 0 0 0 0 1 1 0 1 1 0 0 0 0 1 1 0 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 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]

last modified: 2006-04-03

Notes


This page is maintained by Markus Grassl (codes@codetables.de). Last change: 23.10.2014