Bounds on the minimum distance of linear codes

Bounds on linear codes [213,10] over GF(3)

Construction

Construction of a linear code [213,10,129] over GF(3):
[1]:  [3, 2, 2] Cyclic Linear Code over GF(3)
     Dual of the RepetitionCode of length 3
[2]:  [210, 8, 129] Linear Code over GF(3)
     QuasiTwistedCyclicCode of length 210 and constant 2 with generators: (0 0 0 0 0 0 1 0 0 1 0 1 0 0 1),  (1 2 0 0 2 2 0 0 1 1 1 1 0 1 2),  (1 2 2 1 0 0 1 0 1 2 2 2 1 0 2),  (1 2 2 1 0 0 2 2 2 2 2 0 0 1 2),  (1 1 1 2 0 0 1 1 2 0 2 0 0 0 0),  (2 0 1 2 1 2 0 1 2 0 0 0 0 0 2),  (1 2 1 0 1 1 1 1 1 2 0 2 0 1 1),  (0 0 1 0 2 2 0 1 0 0 2 0 0 0 1),  (1 2 1 1 1 1 2 0 0 1 0 0 2 2 0),  (2 1 2 1 0 2 1 2 1 2 0 0 0 0 2),  (2 2 1 1 1 2 0 1 2 1 0 1 0 1 0),  (2 2 0 0 0 1 2 1 2 2 2 0 1 2 2),  (1 0 2 1 0 1 0 1 0 2 0 0 2 2 2),  (1 0 0 1 0 1 1 2 2 0 0 1 2 1 0)
[3]:  [210, 10, 127] Linear Code over GF(3)
     QuasiTwistedCyclicCode of length 210 and constant 2 with generators: (0 1 0 0 0 0 0 0 0 0 0 2 0 0 0),  (1 1 2 0 1 0 1 2 0 0 2 0 0 0 2),  (2 0 2 1 2 0 0 2 2 0 1 0 0 1 1),  (0 0 1 1 2 1 0 2 1 0 1 0 1 0 1),  (2 0 2 1 0 0 1 2 1 2 1 1 0 0 2),  (1 2 1 2 0 0 1 2 1 1 2 2 1 2 1),  (0 2 0 1 2 2 0 0 1 2 2 1 0 0 0),  (1 0 2 2 1 1 1 1 2 0 0 1 2 0 2),  (2 2 2 0 1 0 1 1 2 1 1 2 2 2 0),  (2 2 2 1 0 2 1 1 0 2 0 2 2 2 2),  (1 2 0 0 1 1 1 1 1 1 0 2 1 1 0),  (1 2 1 1 0 0 0 0 0 0 2 1 2 2 0),  (2 0 0 0 2 2 0 2 0 0 0 0 2 0 1),  (0 1 1 1 2 1 2 1 1 1 1 1 0 0 2)
[4]:  [213, 10, 129] Linear Code over GF(3)
     ConstructionX using [3] [2] and [1]

last modified: 2011-08-30

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

Lb(213,10) = 128 is found by shortening of:
Lb(214,11) = 128 MSY

Ub(213,10) = 135 is found by considering shortening to:
Ub(212,9) = 135 Gur

References

MSY: T. Maruta, M. Shinohara, F. Yamane, K. Tsuji, E. Takata, H. Miki & R. Fujiwara, New linear codes from cyclic or generalized cyclic codes by puncturing, to appear in Proc. 10th International Workshop on Algebraic and Combinatorial Coding Theory(ACCT-10) in Zvenigorod, Russia, 2006.

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