| lower bound: | 106 |
| upper bound: | 106 |
Construction of a linear code [220,10,106] 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]: [221, 11, 106] Linear Code over GF(2)
generalized residue code of [7]
puncturing at the support of a word of weight 220
[9]: [220, 10, 106] Linear Code over GF(2)
Shortening of [8] at { 221 }
last modified: 2001-01-30
Lb(220,10) = 106 is found by shortening of: Lb(221,11) = 106 EB1 Ub(220,10) = 106 follows by a one-step Griesmer bound from: Ub(113,9) = 53 follows by a one-step Griesmer bound from: Ub(59,8) = 26 otherwise adding a parity check bit would contradict: Ub(60,8) = 27 BJV
EB1: Y. Edel & J. Bierbrauer, Some codes related to BCH codes of low dimension, preprint, 1995.
Notes
|