| lower bound: | 72 |
| upper bound: | 74 |
Construction of a linear code [158,11,72] over GF(2):
[1]: [3, 2, 2] Cyclic Linear Code over GF(2)
CordaroWagnerCode of length 3
[2]: [1, 1, 1] Cyclic Linear Code over GF(2^2)
UniverseCode of length 1 over GF(4)
[3]: [51, 46] Cyclic Linear Code over GF(2^2)
CyclicCode of length 51 with generating polynomial x^5 + w*x^3 + x + w
[4]: [51, 5, 35] Cyclic Linear Code over GF(2^2)
Dual of [3]
[5]: [52, 5, 36] Linear Code over GF(2^2)
ExtendCode [4] by 1
[6]: [51, 45] Cyclic Linear Code over GF(2^2)
CyclicCode of length 51 with generating polynomial x^6 + w^2*x^5 + w*x^4 + x^3 + x^2 + x + 1
[7]: [51, 6, 34] Cyclic Linear Code over GF(2^2)
Dual of [6]
[8]: [52, 6, 35] Linear Code over GF(2^2)
ExtendCode [7] by 1
[9]: [53, 6, 36] Linear Code over GF(2^2)
ConstructionX using [8] [5] and [2]
[10]: [159, 12, 72] Quasicyclic of degree 53 Linear Code over GF(2)
ConcatenatedCode of [9] and [1]
[11]: [158, 11, 72] Linear Code over GF(2)
Shortening of [10] at { 159 }
last modified: 2001-01-30
Lb(158,11) = 72 is found by shortening of: Lb(159,12) = 72 BZ Ub(158,11) = 74 follows by a one-step Griesmer bound from: Ub(83,10) = 37 Ja
Ja: D.B. Jaffe, Binary linear codes: new results on nonexistence, 1996, code.ps.gz.
Notes
|