lower bound: | 53 |
upper bound: | 55 |
Construction of a linear code [93,11,53] over GF(3): [1]: [93, 11, 53] 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, 2, 0, 2, 2, 2, 0, 2, 2, 1, 2, 2, 2, 2, 1, 0, 2, 2, 0, 2, 1, 2, 1, 0, 2, 2, 0, 1, 1, 0, 1, 2, 2, 1, 2, 0, 0, 1, 0, 2, 1, 0, 1, 2, 1, 1, 0, 0, 1, 1, 1, 1, 1, 2, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 1, 1, 2, 2, 2, 0, 1, 1, 1, 2, 1, 0, 2, 1, 0, 1, 0 ] [ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 2, 1, 2, 0, 2, 0, 0, 2, 2, 0, 2, 2, 0, 2, 2, 1, 1, 1, 0, 2, 0, 2, 1, 1, 1, 1, 1, 0, 0, 1, 2, 1, 0, 1, 2, 1, 0, 0, 2, 2, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 2, 1, 1, 1, 1, 1, 0, 1, 2, 1, 2, 1, 0, 2, 2, 0, 2, 1, 0, 0, 2, 2 ] [ 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 1, 1, 1, 1, 0, 0, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 2, 2, 1, 0, 2, 1, 0, 0, 0, 0, 2, 0, 0, 2, 1, 0, 2, 1, 0, 2, 1, 2, 1, 0, 1, 0, 1, 1, 0, 0, 2, 2, 2, 0, 1, 2, 2, 0, 2, 0, 2, 1, 1, 0, 2, 0, 1, 2, 2, 2, 2, 1, 0, 2, 2, 0, 2, 1, 2, 2, 0, 0 ] [ 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 2, 0, 2, 1, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 0, 2, 1, 1, 0, 1, 1, 1, 2, 0, 2, 0, 1, 2, 1, 0, 2, 2, 2, 1, 2, 0, 1, 1, 1, 1, 1, 2, 1, 1, 0, 2, 1, 1, 0, 2, 1, 2, 1, 0, 1, 0, 2, 2, 2, 0, 1, 1, 0, 0, 1, 2, 0, 0, 2, 0, 0, 1, 1, 2, 0, 2, 2, 1, 0, 1, 1, 0, 0 ] [ 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 1, 1, 2, 0, 0, 2, 0, 0, 0, 1, 0, 1, 0, 1, 2, 2, 1, 0, 2, 1, 0, 1, 2, 0, 0, 0, 2, 0, 0, 0, 2, 2, 2, 0, 0, 2, 2, 2, 2, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0, 0, 2, 2, 0, 2, 1, 2, 1, 2, 2, 2, 2, 1, 1, 2, 0, 1, 1, 2, 0, 2, 1, 1, 0 ] [ 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 2, 2, 0, 1, 0, 2, 2, 2, 0, 1, 2, 2, 0, 0, 2, 2, 0, 0, 1, 1, 2, 2, 1, 1, 0, 0, 2, 0, 1, 0, 1, 2, 1, 2, 2, 2, 2, 0, 1, 2, 2, 0, 1, 0, 1, 2, 2, 0, 0, 0, 1, 2, 1, 2, 1, 1, 1, 0, 2, 2, 1, 1, 0, 2, 0, 0, 2, 0, 0, 1, 1, 1, 0, 0, 0, 0, 2, 1, 0, 2 ] [ 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 2, 0, 2, 0, 0, 1, 1, 0, 2, 2, 0, 2, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 2, 1, 1, 1, 1, 1, 2, 2, 0, 0, 1, 2, 0, 1, 0, 0, 0, 2, 0, 2, 0, 1, 0, 1, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 2, 2, 0, 1, 2, 0, 0, 0, 1, 0, 2, 2, 0, 2, 1, 0, 2, 2, 2, 2, 2, 0, 0 ] [ 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 2, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 2, 2, 2, 2, 0, 1, 2, 2, 2, 0, 2, 0, 0, 0, 1, 2, 1, 1, 2, 1, 2, 0, 2, 1, 2, 0, 0, 1, 1, 1, 2, 0, 0, 1, 2, 0, 2, 1, 2, 2, 2, 0, 2, 0, 0, 0, 1, 2, 0, 1, 0, 1, 2, 2, 1, 2, 1, 0, 2, 0, 2, 2, 2, 1, 1, 1, 1 ] [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 2, 2, 2, 0, 0, 2, 2, 2, 0, 0, 2, 0, 0, 0, 1, 2, 2, 2, 1, 2, 0, 2, 1, 2, 0, 2, 1, 1, 0, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 0, 2, 1, 2, 0, 1, 1, 1, 1, 1, 0, 0, 2, 2, 0, 1, 1, 0, 2, 0, 0, 0, 1, 0, 0, 1, 1, 2, 1, 0, 1, 2, 0, 0, 0, 0, 0, 2, 0, 2 ] [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 1, 0, 0, 2, 0, 0, 0, 1, 2, 2, 0, 1, 1, 2, 1, 2, 1, 2, 1, 0, 1, 1, 1, 0, 0, 2, 1, 0, 0, 0, 1, 0, 2, 0, 0, 1, 0, 2, 2, 0, 1, 0, 1, 0, 1, 2, 2, 2, 1, 2, 2, 1, 1, 2, 2, 1, 0, 0, 0, 2, 2, 1, 2, 0, 0, 1, 1, 0, 0, 1, 1, 2, 0, 1, 2, 0, 1, 1, 0, 2, 1 ] [ 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, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0 ] last modified: 2010-02-16
Lb(93,11) = 52 is found by truncation of: Lb(95,11) = 54 MST Ub(93,11) = 55 follows by a one-step Griesmer bound from: Ub(37,10) = 18 follows by a one-step Griesmer bound from: Ub(18,9) = 6 is found by considering shortening to: Ub(16,7) = 6 vE2
vE2: M. van Eupen, Four nonexistence results for ternary linear codes, IEEE Trans. Inform. Theory 41 (1995) 800-805.
Notes
|