Information on Result #132229
There is no OOA(2183, 293, S2, 2, 81), because 1 step m-reduction would yield OA(2182, 293, S2, 80), but
- 6 times code embedding in larger space [i] would yield OA(2188, 299, S2, 80), but
- adding a parity check bit [i] would yield OA(2189, 300, S2, 81), but
- the linear programming bound shows that M ≥ 333112 132422 259965 088720 215000 611770 757764 145862 673192 223023 087630 748136 412561 549060 805697 390758 928463 024902 788757 444450 017971 109260 951552 / 284 805581 394495 166949 489186 936966 421059 043171 883994 793835 511370 537717 840519 721875 > 2189 [i]
- adding a parity check bit [i] would yield OA(2189, 300, S2, 81), but
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.
Other Results with Identical Parameters
None.
Depending Results
The following results depend on this result:
Result | This result only | Method | ||
---|---|---|---|---|
1 | No OOA(2183, 293, S2, 3, 81) | [i] | Depth Reduction | |
2 | No OOA(2183, 293, S2, 4, 81) | [i] | ||
3 | No OOA(2183, 293, S2, 5, 81) | [i] | ||
4 | No OOA(2183, 293, S2, 6, 81) | [i] | ||
5 | No OOA(2183, 293, S2, 7, 81) | [i] | ||
6 | No OOA(2183, 293, S2, 8, 81) | [i] |