Information on Result #341394
There is no OOA(2188, 290, S2, 5, 85), because 3 times depth reduction would yield OOA(2188, 290, S2, 2, 85), but
- 1 step m-reduction [i] would yield OA(2187, 290, S2, 84), but
- 9 times code embedding in larger space [i] would yield OA(2196, 299, S2, 84), but
- adding a parity check bit [i] would yield OA(2197, 300, S2, 85), but
- the linear programming bound shows that M ≥ 333445 596634 842101 957662 761369 966680 970228 955880 375209 681209 067512 159971 176505 925710 036206 046927 475988 200870 117376 / 1 055603 696799 631985 996897 950925 994087 362055 971326 408581 > 2197 [i]
- adding a parity check bit [i] would yield OA(2197, 300, S2, 85), but
- 9 times code embedding in larger space [i] would yield OA(2196, 299, S2, 84), 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.