Information on Result #455401
There is no OOA(2201, 291, S2, 8, 91), because 6 times depth reduction would yield OOA(2201, 291, S2, 2, 91), but
- 1 step m-reduction [i] would yield OA(2200, 291, S2, 90), but
- 8 times code embedding in larger space [i] would yield OA(2208, 299, S2, 90), but
- adding a parity check bit [i] would yield OA(2209, 300, S2, 91), but
- the linear programming bound shows that M ≥ 437987 836379 661851 428112 482969 460104 960459 291237 979833 080590 515802 667419 590325 215760 903409 709975 863296 / 433 753365 263741 276278 643266 060465 678125 > 2209 [i]
- adding a parity check bit [i] would yield OA(2209, 300, S2, 91), but
- 8 times code embedding in larger space [i] would yield OA(2208, 299, S2, 90), 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.