lower bound: | 69 |
upper bound: | 69 |
Construction of a linear code [108,6,69] over GF(3): [1]: [108, 7, 69] Linear Code over GF(3) Construction from a stored generator matrix: [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 1, 1, 2, 2, 1, 0, 1, 1, 1, 1, 2, 0, 0, 1, 1, 2, 1, 2, 1, 0, 0, 0, 2, 0, 1, 2, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 2, 2, 0, 2, 1, 1, 0, 2, 0, 1, 2, 2, 0, 1, 2, 0, 2, 0, 2, 2, 0, 1, 2, 2, 1, 2, 0, 0, 1, 1, 1, 1, 1, 1, 2, 0, 2, 2, 0, 0, 2, 2, 2, 1, 0, 0, 2, 2, 0, 2, 1, 2, 2, 2, 1, 1, 1 ] [ 0, 1, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 2, 1, 1, 1, 0, 0, 2, 0, 2, 1, 1, 1, 1, 2, 2, 1, 1, 0, 0, 0, 1, 2, 2, 2, 0, 1, 2, 0, 0, 2, 0, 2, 2, 2, 1, 0, 0, 2, 2, 2, 1, 0, 1, 2, 1, 1, 1, 2, 2, 2, 2, 1, 1, 0, 0, 2, 2, 2, 1, 0, 2, 1, 2, 1, 0, 2, 2, 2, 1, 0, 2, 2, 2, 2, 0, 0, 0, 0, 0, 1, 1, 0, 2, 0, 2, 1, 1, 2, 0, 2, 0, 0 ] [ 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 2, 1, 2, 1, 1, 2, 0, 2, 0, 1, 0, 0, 0, 0, 2, 0, 2, 2, 0, 2, 0, 2, 1, 1, 2, 1, 2, 2, 0, 2, 2, 0, 2, 0, 0, 2, 2, 2, 2, 1, 0, 1, 1, 1, 1, 1, 1, 2, 0, 0, 0, 2, 2, 0, 0, 1, 0, 2, 2, 1, 2, 1, 0, 0, 2, 0, 2, 0, 2, 1, 0, 1, 1, 2, 0, 2, 1, 2, 2, 0, 2, 1, 2, 0, 1, 2, 1, 1, 2, 0, 0, 1, 0, 1, 1, 1 ] [ 0, 0, 0, 0, 0, 1, 0, 1, 2, 0, 0, 1, 1, 2, 1, 0, 2, 0, 1, 1, 2, 1, 1, 2, 0, 1, 1, 0, 0, 1, 0, 0, 2, 2, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 2, 1, 1, 0, 1, 2, 1, 1, 2, 1, 0, 2, 2, 1, 2, 1, 0, 2, 0, 0, 2, 2, 1, 0, 0, 0, 2, 2, 0, 1, 1, 2, 1, 1, 2, 1, 0, 2, 1, 1, 1, 2, 0, 2, 1, 0, 1, 1, 2, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 2, 2, 2, 1 ] [ 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 2, 2, 0, 1, 1, 1, 1, 0, 1, 2, 0, 2, 1, 0, 2, 1, 2, 0, 0, 1, 1, 2, 1, 2, 2, 0, 2, 0, 2, 2, 1, 0, 0, 1, 0, 1, 1, 2, 0, 0, 0, 2, 2, 1, 0, 2, 1, 1, 2, 0, 0, 1, 1, 1, 1, 2, 1, 2, 2, 0, 1, 2, 0, 1, 0, 2, 0, 2, 0, 2, 1, 0, 1, 0, 1, 2, 2, 2, 0, 0, 2, 2, 2, 2, 1, 1, 0, 1, 2, 0, 1, 2, 2, 1, 2, 2, 1 ] [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 1, 0, 1, 2, 1, 1, 2, 0, 2, 2, 2, 0, 1, 1, 2, 2, 2, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 2, 1, 0, 1, 2, 0, 2, 1, 2, 1, 2, 1, 0, 2, 0, 2, 2, 0, 2, 2, 0, 1, 2, 0, 2, 0, 2, 0, 0, 2, 2, 1, 1, 0, 0, 0, 2, 0, 2, 1, 0, 0, 2, 2, 2, 1, 2, 2, 1, 0, 1, 2, 2, 0, 2, 2, 2, 1, 0, 2, 2, 1, 1, 0, 2, 1 ] [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 1, 1, 2, 0, 1, 1, 1, 1, 2, 0, 1, 2, 1, 2, 2, 0, 1, 2, 1, 1, 1, 0, 0, 2, 2, 2, 0, 0, 1, 0, 0, 1, 1, 2, 0, 2, 0, 0, 2, 2, 2, 0, 0, 2, 2, 1, 2, 0, 0, 1, 0, 0, 1, 2, 1, 0, 0, 0, 2, 2, 2, 1, 2, 1, 1, 2, 0, 2, 1, 2, 0, 1, 0, 2, 2, 2, 2, 1, 0, 1, 1, 2, 1, 0, 2, 2, 2, 1, 0, 0, 2, 0, 1 ] [2]: [108, 6, 69] Linear Code over GF(3) Subcode of [1] last modified: 2008-05-17
Lb(108,6) = 69 is found by taking a subcode of: Lb(108,7) = 69 EB1 Ub(108,6) = 69 Ma
Ma: T. Maruta, On the nonexistence of linear codes attaining the Griesmer bound, Geom. Dedicata 60 (1996) 1-7. T. Maruta, On the nonexistence of linear codes of dimension four attaining the Griesmer bound, pp. 117-120 in: Optimal codes and related topics, Proc. Workshop Sozopol, Bulgaria, 1995. T. Maruta, The nonexistence of [116,5,85]_4 codes and [187,5,139]_4 codes, Proc. 2nd International Workshop on Optimal Codes and Related Topics in Sozopol (1998), pp. 168-174. T. Maruta & M. Fukui, On the nonexistence of some linear codes of dimension 4 over GF(5), preprint, 1995. T. Maruta, M. Takenaka, M. Shinohara, K. Masuda & S. Kawashima, Constructing new linear codes over small fields, preprint 2004.
Notes
|