| lower bound: | 92 |
| upper bound: | 92 |
Construction of a linear code [192,10,92] over GF(2):
[1]: [192, 8, 96] Linear Code over GF(2)
SubcodeWordsOfWeight using weight { 0, 96, 128 } words of [8]
[2]: [4, 1, 4] Cyclic Linear Code over GF(2)
RepetitionCode of length 4
[3]: [4, 3, 2] Cyclic Linear Code over GF(2)
Dual of the RepetitionCode of length 4
[4]: [8, 4, 4] "Reed-Muller Code (r = 1, m = 3)" Linear Code over GF(2)
PlotkinSum of [3] and [2]
[5]: [7, 3, 4] Linear Code over GF(2)
Shortening of [4] at 1
[6]: [64, 4, 55] Linear Code over GF(2^3)
BCHCode over GF(8) with parameters 63 54
[7]: [448, 12, 220] Linear Code over GF(2)
ConcatenatedCode of [6] and [5]
[8]: [192, 11, 92] Linear Code over GF(2)
generalized residue code of [7]
puncturing at the support of a word of weight 256
[9]: [192, 10, 92] Linear Code over GF(2)
SubcodeBetweenCode of dimension 10 of [8] and [1]
last modified: 2001-04-27
Lb(192,10) = 92 is found by taking a subcode of: Lb(192,11) = 92 EB2 Ub(192,10) = 92 follows by a one-step Griesmer bound from: Ub(99,9) = 46 otherwise adding a parity check bit would contradict: Ub(100,9) = 47 Bro
EB2: Y. Edel & J. Bierbrauer, Twisted BCH codes, J. of Combinatorial Designs 5 (1997) 377-389.
Notes
|