| lower bound: | 37 |
| upper bound: | 37 |
Construction of a linear code [78,7,37] over GF(2):
[1]: [51, 8, 24] Cyclic Linear Code over GF(2)
CyclicCode of length 51 with generating polynomial x^43 + x^42 + x^41 + x^37 + x^36 + x^33 + x^30 + x^29 + x^27 + x^26 + x^25 + x^22 + x^21 + x^20 + x^19 + x^17 + x^16 + x^13 + x^12 + x^10 + x^7 + x^5 + x^4 + 1
[2]: [50, 8, 23] Linear Code over GF(2)
Puncturing of [1] at { 51 }
[3]: [27, 7, 12] Linear Code over GF(2)
Puncturing of [2] at { 1, 9, 13, 14, 16, 19, 21, 22, 25, 26, 28, 29, 30, 31, 34, 35, 36, 38, 39, 42, 45, 46, 50 }
[4]: [154, 8, 75] Linear Code over GF(2)
Let C1 be the BCHCode over GF( 2) of parameters 127 63. Let C2 the SubcodeBetweenCode of dimension 8 between C1 and the BCHCode with
parameters 127 64. Return ConstructionX using C1, C2 and [3]
[5]: [151, 8, 73] Linear Code over GF(2)
Puncturing of [4] at { 1, 127, 147 }
[6]: [78, 7, 37] Linear Code over GF(2)
ResidueCode of [5]
last modified: 2001-01-30
Lb(78,7) = 37 is found by construction A: taking the residue of: Lb(151,8) = 73 BEx Ub(78,7) = 37 follows by a one-step Griesmer bound from: Ub(40,6) = 18 BM
BM: L.D. Baumert & R.J. McEliece, A note on the Griesmer bound, IEEE Trans. Inform. Theory IT-19 (Jan. 1973) 134-135.
Notes
|