lower bound: | 47 |
upper bound: | 47 |
Construction of a linear code [102,10,47] 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]: [103, 10, 48] Linear Code over GF(2) generalized residue code of [12] puncturing at the support of a word of weight 96 [14]: [102, 10, 47] Linear Code over GF(2) Puncturing of [13] at { 103 } last modified: 2002-03-18
Lb(102,10) = 47 is found by construction A: taking the residue of: Lb(195,11) = 93 B2x 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
|