Best Known (182, 182+44, s)-Nets in Base 3
(182, 182+44, 692)-Net over F3 — Constructive and digital
Digital (182, 226, 692)-net over F3, using
- (u, u+v)-construction [i] based on
- digital (0, 22, 4)-net over F3, using
- net from sequence [i] based on digital (0, 3)-sequence over F3, using
- Faure sequence [i]
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F3 with g(F) = 0 and N(F) ≥ 4, using
- the rational function field F3(x) [i]
- Niederreiter sequence [i]
- net from sequence [i] based on digital (0, 3)-sequence over F3, using
- digital (160, 204, 688)-net over F3, using
- trace code for nets [i] based on digital (7, 51, 172)-net over F81, using
- net from sequence [i] based on digital (7, 171)-sequence over F81, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F81 with g(F) = 7 and N(F) ≥ 172, using
- net from sequence [i] based on digital (7, 171)-sequence over F81, using
- trace code for nets [i] based on digital (7, 51, 172)-net over F81, using
- digital (0, 22, 4)-net over F3, using
(182, 182+44, 2739)-Net over F3 — Digital
Digital (182, 226, 2739)-net over F3, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(3226, 2739, F3, 44) (dual of [2739, 2513, 45]-code), using
- 523 step Varšamov–Edel lengthening with (ri) = (4, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 5 times 0, 1, 7 times 0, 1, 11 times 0, 1, 15 times 0, 1, 20 times 0, 1, 26 times 0, 1, 32 times 0, 1, 40 times 0, 1, 46 times 0, 1, 51 times 0, 1, 57 times 0, 1, 60 times 0, 1, 63 times 0, 1, 66 times 0) [i] based on linear OA(3204, 2194, F3, 44) (dual of [2194, 1990, 45]-code), using
- construction X applied to Ce(43) ⊂ Ce(42) [i] based on
- linear OA(3204, 2187, F3, 44) (dual of [2187, 1983, 45]-code), using an extension Ce(43) of the primitive narrow-sense BCH-code C(I) with length 2186 = 37−1, defining interval I = [1,43], and designed minimum distance d ≥ |I|+1 = 44 [i]
- linear OA(3197, 2187, F3, 43) (dual of [2187, 1990, 44]-code), using an extension Ce(42) of the primitive narrow-sense BCH-code C(I) with length 2186 = 37−1, defining interval I = [1,42], and designed minimum distance d ≥ |I|+1 = 43 [i]
- linear OA(30, 7, F3, 0) (dual of [7, 7, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(30, s, F3, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- construction X applied to Ce(43) ⊂ Ce(42) [i] based on
- 523 step Varšamov–Edel lengthening with (ri) = (4, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 5 times 0, 1, 7 times 0, 1, 11 times 0, 1, 15 times 0, 1, 20 times 0, 1, 26 times 0, 1, 32 times 0, 1, 40 times 0, 1, 46 times 0, 1, 51 times 0, 1, 57 times 0, 1, 60 times 0, 1, 63 times 0, 1, 66 times 0) [i] based on linear OA(3204, 2194, F3, 44) (dual of [2194, 1990, 45]-code), using
(182, 182+44, 360689)-Net in Base 3 — Upper bound on s
There is no (182, 226, 360690)-net in base 3, because
- the generalized Rao bound for nets shows that 3m ≥ 675169 856020 208042 299048 573780 802356 341690 368559 516490 884637 207868 743873 662549 761288 281206 314423 513382 845309 > 3226 [i]