Information on Result #339084
There is no OOA(2149, 296, S2, 5, 63), because 3 times depth reduction would yield OOA(2149, 296, S2, 2, 63), but
- 1 step m-reduction [i] would yield OA(2148, 296, S2, 62), but
- 3 times code embedding in larger space [i] would yield OA(2151, 299, S2, 62), but
- adding a parity check bit [i] would yield OA(2152, 300, S2, 63), but
- the linear programming bound shows that M ≥ 1 822920 957032 908710 300389 173411 682235 603743 600718 371815 426352 372851 396294 641510 983638 017093 363995 208653 722934 746993 732112 453103 710016 735018 198981 581634 152182 044263 594413 848248 874036 866566 735939 553456 835204 576530 181303 910420 691160 014878 461130 563395 780608 / 229 929733 295745 871030 288711 236996 995307 447399 222943 244777 371812 844585 893126 134003 764438 009627 688452 810237 265600 326493 146031 667493 552702 960873 168604 971608 376264 793116 919937 125888 078239 505634 182777 681229 361167 > 2152 [i]
- adding a parity check bit [i] would yield OA(2152, 300, S2, 63), but
- 3 times code embedding in larger space [i] would yield OA(2151, 299, S2, 62), 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.