| lower bound: | 91 |
| upper bound: | 91 |
Construction of a linear code [188,9,91] 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]: [448, 12, 220] Linear Code over GF(2)
ConcatenatedCode of [5] and [4]
[7]: [192, 11, 92] Linear Code over GF(2)
generalized residue code of [6]
puncturing at the support of a word of weight 256
[8]: [189, 11, 90] Linear Code over GF(2)
Puncturing of [7] at { 190, 191, 192 }
[9]: [189, 9, 92] Linear Code over GF(2)
SubcodeWordsOfWeight using weight 92 words of [8]
[10]: [188, 9, 91] Linear Code over GF(2)
Puncturing of [9] at { 189 }
last modified: 2001-01-30
Lb(188,9) = 91 is found by truncation of: Lb(189,9) = 92 EB2 Ub(188,9) = 91 is found by considering truncation to: Ub(187,9) = 90 Ja
Ja: D.B. Jaffe, Binary linear codes: new results on nonexistence, 1996, code.ps.gz.
Notes
|