lower bound: | 21 |
upper bound: | 21 |
Construction of a linear code [39,8,21] over GF(3): [1]: [39, 8, 21] Linear Code over GF(3) Code found by Axel Kohnert Construction from a stored generator matrix: [ 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 1, 0, 1, 0, 2, 0, 1, 2, 2, 1, 0, 0, 2, 1, 2, 0, 1, 0, 1, 1, 2, 2, 1, 0, 0, 1 ] [ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 0, 1, 2, 1, 1, 0, 0, 2, 2, 0, 2, 1, 1, 1, 0, 1, 2, 2, 0, 2, 0, 0, 1, 2, 0 ] [ 0, 0, 1, 0, 0, 0, 0, 0, 1, 2, 2, 1, 1, 0, 0, 1, 0, 0, 1, 1, 2, 1, 1, 0, 2, 1, 0, 2, 1, 0, 0, 1, 2, 0, 2, 0, 0, 2, 2 ] [ 0, 0, 0, 1, 0, 0, 0, 2, 1, 1, 2, 1, 0, 2, 0, 0, 0, 1, 2, 0, 0, 0, 1, 1, 2, 2, 0, 1, 1, 0, 2, 2, 0, 2, 1, 1, 2, 0, 0 ] [ 0, 0, 0, 0, 1, 0, 0, 2, 1, 2, 2, 1, 0, 0, 0, 0, 1, 0, 0, 0, 2, 2, 2, 2, 1, 0, 1, 2, 1, 0, 2, 2, 2, 1, 0, 2, 0, 1, 0 ] [ 0, 0, 0, 0, 0, 1, 0, 2, 0, 1, 1, 1, 0, 2, 0, 2, 2, 2, 0, 0, 0, 1, 0, 2, 0, 2, 1, 0, 2, 2, 1, 2, 0, 1, 1, 0, 1, 0, 1 ] [ 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0 ] last modified: 2008-11-06
Lb(39,8) = 20 is found by shortening of: Lb(40,9) = 20 is found by truncation of: Lb(41,9) = 21 DaH Ub(39,8) = 21 follows by a one-step Griesmer bound from: Ub(17,7) = 7 is found by considering shortening to: Ub(16,6) = 7 vE2
vE2: M. van Eupen, Four nonexistence results for ternary linear codes, IEEE Trans. Inform. Theory 41 (1995) 800-805.
Notes
|