lower bound: | 39 |
upper bound: | 39 |
Construction of a linear code [86,10,39] over GF(2): [1]: [7, 4, 3] Linear Code over GF(2) Puncturing of [6] at 1 [2]: [6, 3, 3] Linear Code over GF(2) Shortening of [1] at 1 [3]: [192, 8, 96] Linear Code over GF(2) SubcodeWordsOfWeight using weight { 0, 96, 128 } words of [10] [4]: [4, 1, 4] Cyclic Linear Code over GF(2) RepetitionCode of length 4 [5]: [4, 3, 2] Cyclic Linear Code over GF(2) Dual of the RepetitionCode of length 4 [6]: [8, 4, 4] Quasicyclic of degree 2 Linear Code over GF(2) PlotkinSum of [5] and [4] [7]: [7, 3, 4] Linear Code over GF(2) Shortening of [6] at 1 [8]: [64, 4, 55] Linear Code over GF(2^3) BCHCode over GF(8) with parameters 63 54 [9]: [448, 12, 220] Linear Code over GF(2) ConcatenatedCode of [8] and [7] [10]: [192, 11, 92] Linear Code over GF(2) generalized residue code of [9] puncturing at the support of a word of weight 256 [11]: [198, 11, 95] Linear Code over GF(2) ConstructionX using [10] [3] and [2] [12]: [199, 11, 96] Linear Code over GF(2) ExtendCode [11] by 1 [13]: [87, 10, 40] Linear Code over GF(2) puncturing at the support of a word of weight 112 [14]: [86, 10, 39] Linear Code over GF(2) Puncturing of [13] at { 87 } last modified: 2001-01-30
Lb(86,10) = 39 is found by truncation of: Lb(87,10) = 40 EB2 Ub(86,10) = 39 is found by considering truncation to: Ub(85,10) = 38 Ja
Ja: D.B. Jaffe, Binary linear codes: new results on nonexistence, 1996, code.ps.gz.
Notes
|