| lower bound: | 93 |
| upper bound: | 93 |
Construction of a linear code [192,9,93] over GF(2):
[1]: [3, 3, 1] Cyclic Linear Code over GF(2)
UniverseCode of length 3
[2]: [192, 8, 96] Linear Code over GF(2)
SubcodeWordsOfWeight using weight { 0, 96, 128 } words of [9]
[3]: [4, 1, 4] Cyclic Linear Code over GF(2)
RepetitionCode of length 4
[4]: [4, 3, 2] Cyclic Linear Code over GF(2)
Dual of the RepetitionCode of length 4
[5]: [8, 4, 4] "Reed-Muller Code (r = 1, m = 3)" Linear Code over GF(2)
PlotkinSum of [4] and [3]
[6]: [7, 3, 4] Linear Code over GF(2)
Shortening of [5] at 1
[7]: [64, 4, 55] Linear Code over GF(2^3)
BCHCode over GF(8) with parameters 63 54
[8]: [448, 12, 220] Linear Code over GF(2)
ConcatenatedCode of [7] and [6]
[9]: [192, 11, 92] Linear Code over GF(2)
generalized residue code of [8]
puncturing at the support of a word of weight 256
[10]: [195, 11, 93] Linear Code over GF(2)
ConstructionX using [9] [2] and [1]
[11]: [196, 11, 94] Linear Code over GF(2)
ExtendCode [10] by 1
[12]: [193, 9, 94] Linear Code over GF(2)
Shortening of [11] at { 1, 2, 3 }
[13]: [192, 9, 93] Linear Code over GF(2)
Puncturing of [12] at { 193 }
last modified: 2001-01-30
Lb(192,9) = 93 is found by truncation of: Lb(193,9) = 94 B2x Ub(192,9) = 93 is found by considering truncation to: Ub(191,9) = 92 Ja
Ja: D.B. Jaffe, Binary linear codes: new results on nonexistence, 1996, code.ps.gz.
Notes
|