MinT - Best Known (82−38, 82, s)-Nets in Base 81

Best Known (82−38, 82, s)-Nets in Base 81

(82−38, 82, 730)-Net over F₈₁ — Constructive and digital

Digital (44, 82, 730)-net over F₈₁, using

t-expansion [i] based on digital (36, 82, 730)-net over F₈₁, using
- net from sequence [i] based on digital (36, 729)-sequence over F₈₁, using
  - Niederreiterâ€“Xing sequence constructionÂ II/III [i] based on function field F/F₈₁ with g(F) = 36 and N(F) ≥ 730, using
    - the Hermitian function field over F₈₁ [i]

(82−38, 82, 3496)-Net over F₈₁ — Digital

Digital (44, 82, 3496)-net over F₈₁, using

embedding of OOA with Gilbertâ€“VarÅ¡amov bound [i] based on linear OA(81⁸², 3496, F₈₁, 38) (dual of [3496, 3414, 39]-code), using
- discarding factors / shortening the dual code based on linear OA(81⁸², 6584, F₈₁, 38) (dual of [6584, 6502, 39]-code), using
  - constructionÂ X applied to C_e(37) âŠ‚ C_e(29) [i] based on
    1. linear OA(81⁷⁵, 6561, F₈₁, 38) (dual of [6561, 6486, 39]-code), using an extension C_e(37) of the primitive narrow-sense BCH-code C(I) with length 6560Â = 81²âˆ’1, defining interval IÂ =Â [1,37], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 38 [i]
    2. linear OA(81⁵⁹, 6561, F₈₁, 30) (dual of [6561, 6502, 31]-code), using an extension C_e(29) of the primitive narrow-sense BCH-code C(I) with length 6560Â = 81²âˆ’1, defining interval IÂ =Â [1,29], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 30 [i]
    3. linear OA(81⁷, 23, F₈₁, 7) (dual of [23, 16, 8]-code or 23-arc in PG(6,81)), using
      - discarding factors / shortening the dual code based on linear OA(81⁷, 81, F₈₁, 7) (dual of [81, 74, 8]-code or 81-arc in PG(6,81)), using
        Reedâ€“Solomon code RS(74,81) [i]

(82−38, 82, large)-Net in Base 81 — Upper bound on s

There is no (44, 82, large)-net in base 81, because

36 times m-reduction [i] would yield (44, 46, large)-net in base 81, but
- mutually orthogonal hypercube bound [i]