lower bound: | 90 |
upper bound: | 90 |
Construction of a linear code [141,7,90] over GF(3): [1]: [1, 1, 1] Cyclic Linear Code over GF(3) RepetitionCode of length 1 [2]: [140, 6, 90] Quasicyclic of degree 20 Linear Code over GF(3) QuasiCyclicCode of length 140 with generating polynomials: 2*x^6 + 1, 2*x^6 + x^5 + x^3 + 2*x, 2*x^6 + x^5 + x^4 + 2*x^3 + x^2 + 2*x, x^6 + x^4 + x, x^5 + x^2 + 2*x + 2, x^6 + x^5 + x^2 + x + 2, x^6 + 2*x^5 + 2*x^4 + 2*x^2 + 2*x, x^4 + 2*x^2 + 2*x + 1, x^6 + 2*x^5 + x^3 + 2*x, x^6 + 2*x^3 + 2*x^2 + 1, 2*x^6 + 2*x^5 + 2*x^4 + x^3 + 2*x^2, x^6 + 2*x^5 + 2*x^4 + 2*x + 2, 2*x^6 + 2*x^5 + 2*x^3 + 2*x^2 + x, 2*x^4 + 2*x^2 + 2*x, x^3 + x^2 + 2*x + 2, 2*x^5 + x^4 + x^3 + 2*x^2 + 2*x + 1, x^3 + x + 1, 2*x^5 + x^4 + x^3 + x^2 + 2*x + 2, 2*x^6 + 2*x^5 + 2*x^4 + x^3 + x^2 + x, x^6 + x^5 + x^4 + x^3 + x^2 + x [3]: [140, 7, 89] Quasicyclic of degree 20 Linear Code over GF(3) QuasiCyclicCode of length 140 with generating polynomials: 1, x^5 + x^4 + 2*x^3 + 2*x^2 + x + 1, 2*x^6 + x^4 + x^2, x^4 + x^3 + x^2 + 2*x + 2, 2*x^6 + x^2 + 2, x^6 + 2*x^5 + 2*x^4 + 2*x^3 + x, 2*x^6 + x^5 + 2*x^2 + x + 1, x^6 + x^5 + 2*x^4 + 2*x^3 + x^2 + 1, x^6 + x^3 + x^2, x^6 + x^5 + x^4 + 2*x^2 + 2*x, x^6 + 2*x^4 + 2*x^2 + 2*x + 2, 2*x^6 + x^5 + 2*x + 1, 2*x^5 + 2*x^4 + x^3 + x + 1, 2*x^4 + 2*x^3 + x^2, 2*x^6 + 2*x^5 + 2*x^4 + x^2 + 2, x^6 + x^4 + 2*x^3 + x^2 + 1, 2*x^6 + 2*x^5 + 2*x^4 + x + 2, x^6 + x^4 + 2*x^3 + 2*x + 1, x^6 + 2*x^4 + x^2 + 2*x + 2, x^5 + 2*x^4 + x^2 + 2*x + 2 [4]: [141, 7, 90] Linear Code over GF(3) ConstructionX using [3] [2] and [1] last modified: 2004-07-29
Lb(141,7) = 90 GW2 Ub(141,7) = 90 follows by a one-step Griesmer bound from: Ub(50,6) = 30 HJL
HJL:
Notes
|