Bounds on the minimum distance of additive quantum codes

Bounds on [[27,7]]2

lower bound:6
upper bound:8

Construction

Construction of a [[27,7,6]] quantum code:
[1]:  [[26, 8, 6]] Quantum code over GF(2^2)
     Construction from a stored generator matrix
[2]:  [[26, 7, 6]] Quantum code over GF(2^2)
     Subcode of [1]
[3]:  [[27, 7, 6]] 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 1 0 0 1 1 0 0 0 1 0|1 1 1 1 0 1 0 0 0 1 1 0 0 1 1 1 0 0 0 1 0 0 0 1 0 0 0]
      [0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 1 1 0 1 0|0 1 1 1 1 1 0 0 0 1 1 1 1 1 0 0 0 1 0 1 1 1 1 0 1 1 0]
      [0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 0|1 1 0 0 1 0 0 0 1 1 0 0 0 1 1 0 0 0 0 1 1 1 0 0 1 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 1 1 0|0 0 0 1 0 1 0 0 0 0 1 0 1 1 0 0 1 1 1 1 1 0 1 1 0 1 0]
      [0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 1 0|0 1 0 1 1 1 1 1 0 1 0 1 0 0 0 0 0 1 0 0 0 1 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 1 1 0 0 0 0|0 1 1 1 1 1 0 1 0 1 0 0 1 0 1 1 0 1 1 0 0 0 0 1 1 0 0]
      [0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 1 1 0 1 0|1 1 1 1 1 0 1 1 1 0 0 0 1 0 1 1 1 1 0 0 0 1 1 0 1 0 0]
      [0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0|1 0 0 1 0 0 1 0 1 0 0 1 0 1 0 1 1 0 1 0 1 1 0 0 0 1 0]
      [0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 1 0|1 1 1 0 1 1 1 0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 0 1 1 0]
      [0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 1 0 0 1 0 0 0|1 0 1 1 1 0 1 1 1 1 1 1 0 1 1 0 1 0 0 1 1 1 0 0 1 1 0]
      [0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 1 1 0|0 0 0 0 1 1 0 0 1 1 0 0 1 1 1 0 1 1 0 0 1 0 0 0 0 1 0]
      [0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0|1 1 0 0 1 1 1 1 1 1 1 1 0 0 1 1 0 0 1 1 1 0 0 0 1 1 0]
      [0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 1 1 1 1 0|1 1 1 1 0 0 1 1 0 0 0 0 1 0 1 1 1 1 0 1 0 1 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 1 1 1 0|1 0 0 0 1 1 1 0 1 1 0 0 0 1 1 1 1 0 1 0 1 0 1 1 1 0 0]
      [0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 0 1 1 1 0|0 1 0 1 1 1 1 1 0 1 1 0 0 1 0 0 0 1 1 1 0 0 1 0 1 1 0]
      [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 1 0|1 0 0 0 0 0 0 0 1 0 1 1 0 0 0 0 1 0 0 0 0 1 1 1 1 1 0]
      [0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 1 1 1 0 0|0 1 0 1 1 0 0 1 1 0 0 0 0 1 0 1 1 1 1 1 0 1 0 0 0 1 0]
      [0 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 1 1 1 1 1 0 0 0 1 1 1 0 1 0 1 0 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 1 1 1 0 1 1 0 0|1 0 1 1 1 0 1 1 1 1 1 1 0 1 1 0 1 0 0 1 1 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 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]

last modified: 2005-06-30

Notes


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