Best Known (50−20, 50, s)-Nets in Base 49
(50−20, 50, 350)-Net over F49 — Constructive and digital
Digital (30, 50, 350)-net over F49, using
- generalized (u, u+v)-construction [i] based on
- digital (0, 2, 50)-net over F49, using
- digital (0, 3, 50)-net over F49, using
- net from sequence [i] based on digital (0, 49)-sequence over F49, using
- generalized Faure sequence [i]
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F49 with g(F) = 0 and N(F) ≥ 50, using
- the rational function field F49(x) [i]
- Niederreiter sequence [i]
- net from sequence [i] based on digital (0, 49)-sequence over F49, using
- digital (0, 4, 50)-net over F49, using
- net from sequence [i] based on digital (0, 49)-sequence over F49 (see above)
- digital (0, 5, 50)-net over F49, using
- net from sequence [i] based on digital (0, 49)-sequence over F49 (see above)
- digital (0, 6, 50)-net over F49, using
- net from sequence [i] based on digital (0, 49)-sequence over F49 (see above)
- digital (0, 10, 50)-net over F49, using
- net from sequence [i] based on digital (0, 49)-sequence over F49 (see above)
- digital (0, 20, 50)-net over F49, using
- net from sequence [i] based on digital (0, 49)-sequence over F49 (see above)
(50−20, 50, 4643)-Net over F49 — Digital
Digital (30, 50, 4643)-net over F49, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(4950, 4643, F49, 20) (dual of [4643, 4593, 21]-code), using
- 2229 step Varšamov–Edel lengthening with (ri) = (4, 0, 0, 0, 1, 10 times 0, 1, 30 times 0, 1, 82 times 0, 1, 197 times 0, 1, 405 times 0, 1, 646 times 0, 1, 848 times 0) [i] based on linear OA(4939, 2403, F49, 20) (dual of [2403, 2364, 21]-code), using
- construction X applied to Ce(19) ⊂ Ce(18) [i] based on
- linear OA(4939, 2401, F49, 20) (dual of [2401, 2362, 21]-code), using an extension Ce(19) of the primitive narrow-sense BCH-code C(I) with length 2400 = 492−1, defining interval I = [1,19], and designed minimum distance d ≥ |I|+1 = 20 [i]
- linear OA(4937, 2401, F49, 19) (dual of [2401, 2364, 20]-code), using an extension Ce(18) of the primitive narrow-sense BCH-code C(I) with length 2400 = 492−1, defining interval I = [1,18], and designed minimum distance d ≥ |I|+1 = 19 [i]
- linear OA(490, 2, F49, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(490, s, F49, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- construction X applied to Ce(19) ⊂ Ce(18) [i] based on
- 2229 step Varšamov–Edel lengthening with (ri) = (4, 0, 0, 0, 1, 10 times 0, 1, 30 times 0, 1, 82 times 0, 1, 197 times 0, 1, 405 times 0, 1, 646 times 0, 1, 848 times 0) [i] based on linear OA(4939, 2403, F49, 20) (dual of [2403, 2364, 21]-code), using
(50−20, 50, large)-Net in Base 49 — Upper bound on s
There is no (30, 50, large)-net in base 49, because
- 18 times m-reduction [i] would yield (30, 32, large)-net in base 49, but