lower bound: | 131 |
upper bound: | 138 |
Construction of a linear code [219,11,131] over GF(3): [1]: [242, 11, 152] "BCH code (d = 152, b = 91)" Linear Code over GF(3) BCHCode with parameters 242 152 91 [2]: [222, 11, 134] Linear Code over GF(3) Puncturing of [1] at { 2, 3, 5, 24, 26, 29, 46, 50, 52, 57, 59, 88, 91, 109, 149, 197, 201, 214, 241, 242 } [3]: [219, 11, 131] Linear Code over GF(3) Puncturing of [2] at { 220 .. 222 } last modified: 2004-08-18
Lb(219,11) = 131 is found by truncation of: Lb(222,11) = 134 Ma Ub(219,11) = 138 is found by considering truncation to: Ub(218,11) = 137 Gur
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
|