Information on Result #338170
There is no OOA(2131, 299, S2, 5, 53), because 3 times depth reduction would yield OOA(2131, 299, S2, 2, 53), but
- 1 step m-reduction [i] would yield OA(2130, 299, S2, 52), but
- adding a parity check bit [i] would yield OA(2131, 300, S2, 53), but
- the linear programming bound shows that M ≥ 835249 546947 854888 934372 794550 726415 005267 977549 831092 670722 083310 197796 074880 145116 734749 866628 024518 331713 335458 699168 606177 139658 705940 276891 242247 945827 850895 594922 967040 / 197 715390 170736 894872 721273 822471 708749 073790 701017 854820 620754 271824 242229 889302 199127 061206 521535 614768 633139 933238 769796 252031 306401 > 2131 [i]
- adding a parity check bit [i] would yield OA(2131, 300, S2, 53), 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
None.