Bounds on the minimum distance of linear codes

Bounds on linear codes [201,6] over GF(3)

lower bound:132
upper bound:132

Construction

Construction type: Kohnert

Construction of a linear code [201,6,132] over GF(3):
[1]:  [201, 6, 132] Linear Code over GF(3)
     Construction from a stored generator matrix:

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

last modified: 2007-06-18

From Brouwer's table (as of 2007-02-13)

Lb(201,6) = 131 is found by truncation of:
Lb(202,6) = 132 BKW

Ub(201,6) = 132 follows by a one-step Griesmer bound from:
Ub(68,5) = 44 follows by a one-step Griesmer bound from:
Ub(23,4) = 14 is found by considering truncation to:
Ub(21,4) = 12 HN
References
BKW: Michael Braun, Axel Kohnert & Alfred Wassermann, Optimal linear codes from matrix groups, preprint, Mar 2004, and Construction of (sometimes) Optimal Linear Codes, email, Mar 2005.

HN: R. Hill & D.E. Newton, Optimal ternary linear codes, Des. Codes Cryptogr. 2 (1992), 137-157.

Notes

  • All codes establishing the lower bounds were constructed using MAGMA.
  • Upper bounds are taken from the tables of Andries E. Brouwer, with the exception of codes over GF(7) with n>50. For most of these codes, the upper bounds are rather weak. Upper bounds for codes over GF(7) with small dimension have been provided by Rumen Daskalov.
  • Special thanks to John Cannon for his support in this project.
  • A prototype version of MAGMA's code database over GF(2) was written by Tat Chan in 1999 and extended later that year by Damien Fisher. The current release version was developed by Greg White over the period 2001-2006.
  • Thanks also to Allan Steel for his MAGMA support.
  • My apologies to all authors that have contributed codes to this table for not giving specific credits.

  • If you have found any code improving the bounds or some errors, please send me an e-mail:
    codes [at] codetables.de

Homepage | New Query | Contact
This page is maintained by Markus Grassl (codes@codetables.de). Last change: 30.12.2011