Information on Result #131843
There is no OOA(2168, 290, S2, 2, 75), because 1 step m-reduction would yield OA(2167, 290, S2, 74), but
- 9 times code embedding in larger space [i] would yield OA(2176, 299, S2, 74), but
- adding a parity check bit [i] would yield OA(2177, 300, S2, 75), but
- the linear programming bound shows that M ≥ 3 635392 612138 849947 593748 250106 276323 244402 593086 652587 881083 736015 264809 747844 602393 772282 952895 309564 287520 927482 512784 061552 651238 260008 282439 847339 186197 936622 918149 603328 / 16 596489 288891 597431 806767 668273 879726 323125 162254 820959 724017 639569 206174 043207 555202 380507 742012 504078 557367 932811 307081 > 2177 [i]
- adding a parity check bit [i] would yield OA(2177, 300, S2, 75), 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.