Information on Result #386389
There is no OOA(2147, 298, S2, 6, 61), because 4 times depth reduction would yield OOA(2147, 298, S2, 2, 61), but
- 1 step m-reduction [i] would yield OA(2146, 298, S2, 60), but
- 1 times code embedding in larger space [i] would yield OA(2147, 299, S2, 60), but
- adding a parity check bit [i] would yield OA(2148, 300, S2, 61), but
- the linear programming bound shows that M ≥ 105136 800473 490952 225520 267805 459539 798214 028504 347707 095150 350686 812959 234065 848612 773808 595863 593519 982303 777658 516010 091519 767770 474919 303087 529165 787729 563072 888056 116502 296296 071562 989888 891101 634501 491255 596641 166293 581253 564296 028466 674899 811761 448707 686400 / 225 798485 420294 252360 409611 183444 597041 002675 517141 633160 686125 901188 822156 048472 668432 443090 701115 504331 078053 724134 453816 241595 495681 917850 232579 046224 872692 104555 517294 977093 227439 954041 075655 206185 993731 221251 204789 > 2148 [i]
- adding a parity check bit [i] would yield OA(2148, 300, S2, 61), but
- 1 times code embedding in larger space [i] would yield OA(2147, 299, S2, 60), 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.