| lower bound: | 95 |
| upper bound: | 95 |
Construction of a linear code [198,11,95] 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] "Reed-Muller Code (r = 1, m = 3)" 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]
last modified: 2001-02-03
Lb(198,11) = 95 EB2 Ub(198,11) = 95 follows by a one-step Griesmer bound from: Ub(102,10) = 47 Bro
EB2: Y. Edel & J. Bierbrauer, Twisted BCH codes, J. of Combinatorial Designs 5 (1997) 377-389.
Notes
|