lower bound: | 94 |
upper bound: | 94 |
Construction of a linear code [196,11,94] over GF(2): [1]: [3, 3, 1] Cyclic Linear Code over GF(2) UniverseCode of length 3 [2]: [192, 8, 96] Linear Code over GF(2) SubcodeWordsOfWeight using weight { 0, 96, 128 } words of [9] [3]: [4, 1, 4] Cyclic Linear Code over GF(2) RepetitionCode of length 4 [4]: [4, 3, 2] Cyclic Linear Code over GF(2) Dual of the RepetitionCode of length 4 [5]: [8, 4, 4] Quasicyclic of degree 2 Linear Code over GF(2) PlotkinSum of [4] and [3] [6]: [7, 3, 4] Linear Code over GF(2) Shortening of [5] at 1 [7]: [64, 4, 55] Linear Code over GF(2^3) BCHCode over GF(8) with parameters 63 54 [8]: [448, 12, 220] Linear Code over GF(2) ConcatenatedCode of [7] and [6] [9]: [192, 11, 92] Linear Code over GF(2) generalized residue code of [8] puncturing at the support of a word of weight 256 [10]: [195, 11, 93] Linear Code over GF(2) ConstructionX using [9] [2] and [1] [11]: [196, 11, 94] Linear Code over GF(2) ExtendCode [10] by 1 last modified: 2001-01-30
Lb(196,11) = 94 is found by adding a parity check bit to: Lb(195,11) = 93 B2x Ub(196,11) = 94 follows by a one-step Griesmer bound from: Ub(101,10) = 46 otherwise adding a parity check bit would contradict: Ub(102,10) = 47 Bro
Bro: A.E. Brouwer, The linear programming bound for binary linear codes, IEEE Trans. Inform. Th. 39 (1993) 677-680.
Notes
|