lower bound: | 111 |
upper bound: | 113 |
Construction of a linear code [174,7,111] over GF(3): [1]: [182, 7, 117] Quasicyclic of degree 26 Linear Code over GF(3) QuasiCyclicCode of length 182 with generating polynomials: 2*x^6 + x^5 + x^4 + x^3 + x^2 + x + 1, 2*x^5 + x^4 + 2*x^3 + x^2 + x + 1, x^5 + 2*x^4 + 2*x^3 + x^2 + 1, 2*x^6 + 2*x^5 + x^4 + x^3 + x^2 + x + 1, x^5 + 2*x^4 + 2*x^3 + x^2 + 2*x + 1, x + 1, 2*x^5 + x^4 + 2*x^3 + x^2 + 2*x + 1, x^5 + 2*x^4 + x^2 + x + 1, 2*x^5 + x^4 + 2*x^3 + 2*x^2 + 2*x + 1, 2*x^5 + x^4 + x^3 + 2*x^2 + 1, x^4 + 2*x^3 + x^2 + 2*x + 1, x^5 + x^4 + 2*x^3 + 2*x^2 + 1, x^2 + x + 1, 2*x^4 + x^3 + x^2 + 2*x + 1, x^5 + 2*x^4 + 2*x^3 + 2*x^2 + 1, 2*x^4 + 2*x^3 + 2*x + 1, x^5 + 2*x^4 + 2*x^3 + 2*x^2 + 2*x + 1, x^4 + x^2 + 1, x^4 + 2*x^3 + x^2 + 1, x^5 + x^4 + x^3 + 2*x^2 + x + 1, x^4 + 2*x^2 + x + 1, 2*x^6 + 2*x^5 + 2*x^4 + x^3 + x^2 + x + 1, 2*x^4 + 2*x^3 + x^2 + x + 1, 2*x^5 + x^4 + 2*x^3 + 2*x^2 + x + 1, 2*x^5 + 2*x^4 + x^3 + 2*x^2 + 2*x + 1, 2*x^5 + 2*x^4 + 2*x^3 + x^2 + x + 1 [2]: [174, 7, 111] Linear Code over GF(3) Puncturing of [1] at { 15, 22, 36, 56, 61, 102, 150, 160 } last modified: 2004-08-17
Lb(174,7) = 110 is found by truncation of: Lb(176,7) = 112 GO Ub(174,7) = 113 follows by a one-step Griesmer bound from: Ub(60,6) = 37 follows by a one-step Griesmer bound from: Ub(22,5) = 12 is found by considering shortening to: Ub(21,4) = 12 HN
HN: R. Hill & D.E. Newton, Optimal ternary linear codes, Des. Codes Cryptogr. 2 (1992), 137-157.
Notes
|