| lower bound: | 70 |
| upper bound: | 74 |
Construction of a linear code [162,14,70] over GF(2):
[1]: [24, 12, 8] Linear Code over GF(2)
Extend the QRCode over GF(2)of length 23
[2]: [19, 7, 8] Linear Code over GF(2)
Shortening of [1] at { 20 .. 24 }
[3]: [18, 9, 6] Linear Code over GF(2)
Extend the QRCode over GF(2)of length 17
[4]: [17, 9, 5] Cyclic Linear Code over GF(2)
Puncturing of [3] at { 18 }
[5]: [15, 7, 5] Linear Code over GF(2)
Shortening of [4] at { 16 .. 17 }
[6]: [127, 7, 64] "BCH code (d = 64, b = 65)" Linear Code over GF(2)
BCHCode with parameters 127 64 65
[7]: [127, 7, 64] "BCH code (d = 64, b = 73)" Linear Code over GF(2)
BCHCode with parameters 127 64 73
[8]: [127, 14, 56] "BCH code (d = 56, b = 73)" Linear Code over GF(2)
BCHCode with parameters 127 56 73
[9]: [161, 14, 69] Linear Code over GF(2)
ConstructionXX using [8] [7] [6] [5] and [2]
[10]: [162, 14, 70] Linear Code over GF(2)
ExtendCode [9] by 1
last modified: 2001-01-30
Lb(162,14) = 70 is found by adding a parity check bit to: Lb(161,14) = 69 XX Ub(162,14) = 74 follows by a one-step Griesmer bound from: Ub(87,13) = 37 is found by considering truncation to: Ub(86,13) = 36 Ja
XX:
Notes
|