Bounds on the minimum distance of additive quantum codes

Bounds on [[27,9]]2

lower bound:6
upper bound:7

Construction

Construction type: GraQC

Construction of a [[27,9,6]] quantum code:
[1]:  [[27, 9, 6]] Quantum code over GF(2^2)
     quasicyclic code of length 27 stacked to height 2 with 6 generating polynomials

    stabilizer matrix:

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

last modified: 2006-04-04

Notes


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