| lower bound: | 104 |
| upper bound: | 104 |
Construction of a linear code [216,10,104] over GF(2):
[1]: [4, 1, 4] Cyclic Linear Code over GF(2)
RepetitionCode of length 4
[2]: [4, 3, 2] Cyclic Linear Code over GF(2)
Dual of the RepetitionCode of length 4
[3]: [8, 4, 4] "Reed-Muller Code (r = 1, m = 3)" Linear Code over GF(2)
PlotkinSum of [2] and [1]
[4]: [7, 3, 4] Linear Code over GF(2)
Shortening of [3] at 1
[5]: [64, 4, 55] Linear Code over GF(2^3)
BCHCode over GF(8) with parameters 63 54
[6]: [63, 4, 54] Linear Code over GF(2^3)
Puncturing of [5] at 1
[7]: [441, 12, 116] Linear Code over GF(2)
ConcatenatedCode of [6] and [4]
[8]: [217, 11, 104] Linear Code over GF(2)
generalized residue code of [7]
puncturing at the support of a word of weight 224
[9]: [216, 10, 104] Linear Code over GF(2)
Shortening of [8] at { 217 }
last modified: 2001-01-30
Lb(216,10) = 104 is found by shortening of: Lb(217,11) = 104 EB1 Ub(216,10) = 104 follows by a one-step Griesmer bound from: Ub(111,9) = 52 follows by a one-step Griesmer bound from: Ub(58,8) = 26 follows by a one-step Griesmer bound from: Ub(31,7) = 13 vT3
vT3: H.C.A. van Tilborg, The smallest length of binary 7-dimensional linear codes with prescribed minimum distance, Discr. Math. 33 (1981) 197-207.
Notes
|