| lower bound: | 45 |
| upper bound: | 50 |
Construction of a linear code [116,16,45] over GF(2):
[1]: [4, 4, 1] Cyclic Linear Code over GF(2)
UniverseCode of length 4
[2]: [15, 4, 12] "BCH code (d = 12, b = 1)" Linear Code over GF(2^4)
BCHCode over GF(16) with parameters 15 12
[3]: [14, 3, 12] Linear Code over GF(2^4)
Shortening of [2] at 15
[4]: [112, 12, 48] Linear Code over GF(2)
ConcatenatedCode of [3] and [5]
[5]: [8, 4, 4] "Reed-Muller Code (r = 1, m = 3)" Linear Code over GF(2)
ReedMullerCode with parameters 1 3
[6]: [15, 5, 11] "BCH code (d = 11, b = 1)" Linear Code over GF(2^4)
BCHCode over GF(16) with parameters 15 11
[7]: [14, 4, 11] Linear Code over GF(2^4)
Shortening of [6] at 15
[8]: [112, 16, 44] Linear Code over GF(2)
ConcatenatedCode of [7] and [5]
[9]: [116, 16, 45] Linear Code over GF(2)
ConstructionX using [8] [4] and [1]
last modified: 2001-03-12
Lb(116,16) = 45 Ch Ub(116,16) = 50 follows by a one-step Griesmer bound from: Ub(65,15) = 25 follows by a one-step Griesmer bound from: Ub(39,14) = 12 is found by considering shortening to: Ub(38,13) = 12 otherwise adding a parity check bit would contradict: Ub(39,13) = 13 Ja
Ja: D.B. Jaffe, Binary linear codes: new results on nonexistence, 1996, code.ps.gz.
Notes
|