MinT - Best Known (188, 188+54, s)-Nets in Base 4

Best Known (188, 188+54, s)-Nets in Base 4

(188, 188+54, 1052)-Net over F₄ — Constructive and digital

Digital (188, 242, 1052)-net over F₄, using

4² times duplication [i] based on digital (186, 240, 1052)-net over F₄, using
- trace code for nets [i] based on digital (6, 60, 263)-net over F₂₅₆, using
  - net from sequence [i] based on digital (6, 262)-sequence over F₂₅₆, using
    - Niederreiter sequence [i]

(188, 188+54, 4105)-Net over F₄ — Digital

Digital (188, 242, 4105)-net over F₄, using

embedding of OOA with Gilbertâ€“VarÅ¡amov bound [i] based on linear OA(4²⁴², 4105, F₄, 54) (dual of [4105, 3863, 55]-code), using
- 2 step VarÅ¡amovâ€“Edel lengthening with (r_i)Â = (1, 0) [i] based on linear OA(4²⁴¹, 4102, F₄, 54) (dual of [4102, 3861, 55]-code), using
  - constructionÂ X applied to C_e(53) âŠ‚ C_e(52) [i] based on
    1. linear OA(4²⁴¹, 4096, F₄, 54) (dual of [4096, 3855, 55]-code), using an extension C_e(53) of the primitive narrow-sense BCH-code C(I) with length 4095Â = 4⁶âˆ’1, defining interval IÂ =Â [1,53], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 54 [i]
    2. linear OA(4²³⁵, 4096, F₄, 53) (dual of [4096, 3861, 54]-code), using an extension C_e(52) of the primitive narrow-sense BCH-code C(I) with length 4095Â = 4⁶âˆ’1, defining interval IÂ =Â [1,52], and designed minimum distance dÂ â‰¥Â |I|+1Â =Â 53 [i]
    3. linear OA(4⁰, 6, F₄, 0) (dual of [6, 6, 1]-code), using
      - discarding factors / shortening the dual code based on linear OA(4⁰, 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]

(188, 188+54, 906810)-Net in Base 4 — Upper bound on s

There is no (188, 242, 906811)-net in base 4, because

the generalized Rao bound for nets shows that 4^mÂ â‰¥ 49 949208 723835 853652 745339 681631 318559 268805 360476 291400 979280 215991 330006 848096 725480 190873 758268 904413 304844 317667 089692 387512 176412 550761 722180 > 4²⁴² [i]