| lower bound: | 101 |
| upper bound: | 102 |
Construction of a linear code [212,10,101] 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]: [62, 4, 53] Linear Code over GF(2^3)
Puncturing of [5] at { 1, 2 }
[7]: [434, 12, 112] Linear Code over GF(2)
ConcatenatedCode of [6] and [4]
[8]: [214, 11, 102] Linear Code over GF(2)
generalized residue code of [7]
puncturing at the support of a word of weight 220
[9]: [213, 11, 101] Linear Code over GF(2)
Puncturing of [8] at { 214 }
[10]: [212, 10, 101] Linear Code over GF(2)
Shortening of [9] at { 213 }
last modified: 2001-01-30
Lb(212,10) = 101 is found by shortening of: Lb(213,11) = 101 is found by truncation of: Lb(214,11) = 102 EB1 Ub(212,10) = 102 follows by a one-step Griesmer bound from: Ub(109,9) = 51 follows by a one-step Griesmer bound from: Ub(57,8) = 25 BJV
EB1: Y. Edel & J. Bierbrauer, Some codes related to BCH codes of low dimension, preprint, 1995.
Notes
|