| lower bound: | 64 |
| upper bound: | 71 |
Construction of a linear code [160,17,64] over GF(2):
[1]: [17, 10, 8] "BCH code (d = 8, b = 14)" Linear Code over GF(2^4)
BCHCode over GF(16) with parameters 17 8 14
[2]: [10, 3, 8] Linear Code over GF(2^4)
Shortening of [1] at { 11 .. 17 }
[3]: [8, 7, 2] Cyclic Linear Code over GF(2)
Dual of the RepetitionCode of length 8
[4]: [16, 11, 4] Quasicyclic of degree 4 Linear Code over GF(2)
PlotkinSum of [3] and [9]
[5]: [10, 5, 4] Quasicyclic of degree 5 Linear Code over GF(2)
Shortening of [4] at { 11 .. 16 }
[6]: [8, 1, 8] Cyclic Linear Code over GF(2)
RepetitionCode of length 8
[7]: [4, 1, 4] Cyclic Linear Code over GF(2)
RepetitionCode of length 4
[8]: [4, 3, 2] Cyclic Linear Code over GF(2)
Dual of the RepetitionCode of length 4
[9]: [8, 4, 4] "Reed-Muller Code (r = 1, m = 3)" Linear Code over GF(2)
PlotkinSum of [8] and [7]
[10]: [16, 5, 8] Quasicyclic of degree 4 Linear Code over GF(2)
PlotkinSum of [9] and [6]
[11]: [16, 1, 16] Cyclic Linear Code over GF(2)
RepetitionCode of length 16
[12]: [160, 17, 64] Linear Code over GF(2)
ZinovievCode using inner codes: [11] [10], outer codes: [5] [2]
last modified: 2001-04-19
Lb(160,17) = 64 is found by taking a subcode of: Lb(160,19) = 64 GW2 Ub(160,17) = 71 is found by considering shortening to: Ub(159,16) = 71 BK
GW2: M. Grassl & G. White, New Codes from Chains of Quasi-cyclic Codes, ISIT 2005.
Notes
|