lower bound: | 129 |
upper bound: | 130 |
Construction of a linear code [198,6,129] over GF(3): [1]: [198, 6, 129] Quasicyclic of degree 18 Linear Code over GF(3) QuasiCyclicCode of length 198 with generating polynomials: x^9 + 2*x^8 + x^7 + 2*x^6 + 2*x^4 + x^3 + 2*x^2 + 2*x + 2, x^8 + 2*x^6 + 2*x^4 + 2*x^2 + x + 1, x^8 + x^6 + 2*x^3 + 2*x + 1, x^6 + x^5 + 2*x^4 + x + 2, x^7 + x^6 + x^5 + x^3 + 1, x^9 + 2*x^8 + 2*x^6 + 2*x^5 + x^4 + x^3 + x^2 + x + 1, x^7 + 2*x^6 + x^5 + 2*x^4 + 2*x^3 + 2*x^2 + 2*x + 1, x^9 + 2*x^8 + 2*x^6 + x^5 + x^4 + 2*x^3 + 2*x + 2, x^9 + x^8 + x^7 + 2*x^6 + x^4 + x^2 + 2*x + 1, x^8 + 2*x^6 + 2*x^5 + 2*x^4 + x^3 + x^2 + 2*x + 2, x^8 + x^7 + 2*x^6 + 2*x^5 + 2*x^3 + x^2 + x + 1, x^9 + x^7 + x^6 + x^5 + x^4 + 2*x^2 + 2*x + 2, x^8 + x^7 + x^6 + 2*x^5 + x^4 + x^3 + 2*x^2 + 2*x + 1, x^9 + x^7 + 2*x^5 + 2*x^4 + x^3 + x^2 + 2*x + 1, x^6 + 2*x^5 + 2*x^4 + 2*x^3 + x^2 + 1, x^7 + 2*x^6 + 2*x^4 + x^2 + 2, x^9 + x^8 + 2*x^7 + x^5 + x^4 + x^3 + x^2 + 2*x + 2, x^8 + 2*x^7 + 2*x^6 + x^4 + 2*x^3 + 2*x^2 + 2*x + 2 last modified: 2003-10-01
Lb(198,6) = 129 Gu1 Ub(198,6) = 130 follows by a one-step Griesmer bound from: Ub(67,5) = 43 follows by a one-step Griesmer bound from: Ub(23,4) = 14 is found by considering truncation to: Ub(21,4) = 12 HN
HN: R. Hill & D.E. Newton, Optimal ternary linear codes, Des. Codes Cryptogr. 2 (1992), 137-157.
Notes
|