Information on Result #2026384
There is no OA(236, 40, S2, 20), because adding a parity check bit would yield OA(237, 41, S2, 21), but
- the (dual) Plotkin bound shows that M ≥ 1 649267 441664 / 11 > 237 [i]
Mode: Bound.
Optimality
Show details for fixed k and m, n and k, k and s, k and t, n and m, m and s, m and t, n and s, n and t.
Compare with Markus Grassl’s online database of code parameters.
Other Results with Identical Parameters
None.
Depending Results
The following results depend on this result:
| Result | This result only | Method | ||
|---|---|---|---|---|
| 1 | No OA(238, 42, S2, 22) | [i] | Truncation | |
| 2 | No OA(239, 43, S2, 23) | [i] | ||
| 3 | No OOA(237, 40, S2, 2, 21) | [i] | m-Reduction for OOAs | |
| 4 | No OOA(238, 40, S2, 2, 22) | [i] | ||
| 5 | No OOA(239, 40, S2, 2, 23) | [i] | ||
| 6 | No OOA(240, 40, S2, 2, 24) | [i] | ||
| 7 | No OOA(241, 40, S2, 2, 25) | [i] | ||
| 8 | No OOA(242, 40, S2, 2, 26) | [i] | ||
| 9 | No OOA(243, 40, S2, 2, 27) | [i] | ||
| 10 | No OOA(244, 40, S2, 2, 28) | [i] | ||
| 11 | No OOA(245, 40, S2, 2, 29) | [i] | ||
| 12 | No OOA(246, 40, S2, 2, 30) | [i] | ||
| 13 | No OOA(247, 40, S2, 2, 31) | [i] | ||
| 14 | No OOA(248, 40, S2, 2, 32) | [i] | ||
| 15 | No OOA(249, 40, S2, 2, 33) | [i] | ||
| 16 | No OOA(250, 40, S2, 2, 34) | [i] | ||
| 17 | No OOA(251, 40, S2, 2, 35) | [i] | ||
| 18 | No OOA(236, 40, S2, 2, 20) | [i] | Depth Reduction | |
| 19 | No OOA(236, 40, S2, 3, 20) | [i] | ||
| 20 | No OOA(236, 40, S2, 4, 20) | [i] | ||
| 21 | No OOA(236, 40, S2, 5, 20) | [i] | ||
| 22 | No OOA(236, 40, S2, 6, 20) | [i] | ||
| 23 | No OOA(236, 40, S2, 7, 20) | [i] | ||
| 24 | No OOA(236, 40, S2, 8, 20) | [i] | ||
| 25 | No (16, 36, 40)-net in base 2 | [i] | Extracting Embedded Orthogonal Array | |