MinT - Best Known (30, 47, s)-Nets in Base 9

Best Known (30, 47, s)-Nets in Base 9

(30, 47, 320)-Net over F₉ — Constructive and digital

Digital (30, 47, 320)-net over F₉, using

3 times m-reduction [i] based on digital (30, 50, 320)-net over F₉, using
- trace code for nets [i] based on digital (5, 25, 160)-net over F₈₁, using
  - net from sequence [i] based on digital (5, 159)-sequence over F₈₁, using
    - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₈₁ with g(F) = 5 and N(F) ≥ 160, using
      - a function field by SÃ©mirat [i]

(30, 47, 670)-Net over F₉ — Digital

Digital (30, 47, 670)-net over F₉, using

embedding of OOA with Gilbertâ€“VarÅ¡amov bound [i] based on linear OA(9⁴⁷, 670, F₉, 17) (dual of [670, 623, 18]-code), using
- discarding factors / shortening the dual code based on linear OA(9⁴⁷, 736, F₉, 17) (dual of [736, 689, 18]-code), using
  - constructionÂ X applied to C_e(16) âŠ‚ C_e(14) [i] based on
    1. linear OA(9⁴⁶, 729, F₉, 17) (dual of [729, 683, 18]-code), using an extension C_e(16) of the primitive narrow-sense BCH-code C(I) with length 728Â = 9³âˆ’1, defining interval IÂ =Â [1,16], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 17 [i]
    2. linear OA(9⁴⁰, 729, F₉, 15) (dual of [729, 689, 16]-code), using an extension C_e(14) of the primitive narrow-sense BCH-code C(I) with length 728Â = 9³âˆ’1, defining interval IÂ =Â [1,14], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 15 [i]
    3. linear OA(9¹, 7, F₉, 1) (dual of [7, 6, 2]-code), using
      - discarding factors / shortening the dual code based on linear OA(9¹, s, F₉, 1) (dual of [s, s−1, 2]-code) with arbitrarily large s, using
        parity-check code [i]

(30, 47, 144371)-Net in Base 9 — Upper bound on s

There is no (30, 47, 144372)-net in base 9, because

1 times m-reduction [i] would yield (30, 46, 144372)-net in base 9, but
- the generalized Rao bound for nets shows that 9^mÂ â‰¥ 78 554568 305502 394841 852622 589713 279452 064513 > 9⁴⁶ [i]