MinT - Best Known (215−41, 215, s)-Nets in Base 3

Best Known (215−41, 215, s)-Nets in Base 3

(215−41, 215, 698)-Net over F₃ — Constructive and digital

Digital (174, 215, 698)-net over F₃, using

(u,Â u+v)-construction [i] based on
1. digital (3, 23, 10)-net over F₃, using
  - net from sequence [i] based on digital (3, 9)-sequence over F₃, using
    - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₃ with g(F) = 3 and N(F) ≥ 10, using
      - an explicitly constructive algebraic function field [i]
2. digital (151, 192, 688)-net over F₃, using
  - trace code for nets [i] based on digital (7, 48, 172)-net over F₈₁, using
    - net from sequence [i] based on digital (7, 171)-sequence over F₈₁, using
      - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₈₁ with g(F) = 7 and N(F) ≥ 172, using
        a function field by SÃ©mirat [i]

(215−41, 215, 2913)-Net over F₃ — Digital

Digital (174, 215, 2913)-net over F₃, using

embedding of OOA with Gilbertâ€“VarÅ¡amov bound [i] based on linear OA(3²¹⁵, 2913, F₃, 41) (dual of [2913, 2698, 42]-code), using
- 694 step VarÅ¡amovâ€“Edel lengthening with (r_i)Â = (4, 1, 1, 1, 0, 1, 0, 0, 0, 1, 4 times 0, 1, 6 times 0, 1, 8 times 0, 1, 11 times 0, 1, 15 times 0, 1, 20 times 0, 1, 26 times 0, 1, 32 times 0, 1, 38 times 0, 1, 46 times 0, 1, 52 times 0, 1, 59 times 0, 1, 63 times 0, 1, 68 times 0, 1, 70 times 0, 1, 74 times 0, 1, 76 times 0) [i] based on linear OA(3¹⁹⁰, 2194, F₃, 41) (dual of [2194, 2004, 42]-code), using
  - constructionÂ X applied to C_e(40) âŠ‚ C_e(39) [i] based on
    1. linear OA(3¹⁹⁰, 2187, F₃, 41) (dual of [2187, 1997, 42]-code), using an extension C_e(40) of the primitive narrow-sense BCH-code C(I) with length 2186Â = 3⁷âˆ’1, defining interval IÂ =Â [1,40], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 41 [i]
    2. linear OA(3¹⁸³, 2187, F₃, 40) (dual of [2187, 2004, 41]-code), using an extension C_e(39) of the primitive narrow-sense BCH-code C(I) with length 2186Â = 3⁷âˆ’1, defining interval IÂ =Â [1,39], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 40 [i]
    3. linear OA(3⁰, 7, F₃, 0) (dual of [7, 7, 1]-code), using
      - discarding factors / shortening the dual code based on linear OA(3⁰, s, F₃, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
        OA with only one run / dual of code without redundancy [i]

(215−41, 215, 529002)-Net in Base 3 — Upper bound on s

There is no (174, 215, 529003)-net in base 3, because

1 times m-reduction [i] would yield (174, 214, 529003)-net in base 3, but
- the generalized Rao bound for nets shows that 3^mÂ â‰¥ 1 270451 709527 423819 731214 548735 462600 886111 387044 966818 202882 719529 498182 091466 587954 919789 585527 158201 > 3²¹⁴ [i]