Best Known (23, 23+15, s)-Nets in Base 49
(23, 23+15, 400)-Net over F49 — Constructive and digital
Digital (23, 38, 400)-net over F49, using
- generalized (u, u+v)-construction [i] based on
- digital (0, 1, 50)-net over F49, using
- s-reduction based on digital (0, 1, s)-net over F49 with arbitrarily large s, using
- digital (0, 2, 50)-net over F49, using
- digital (0, 2, 50)-net over F49 (see above)
- 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, 3, 50)-net 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, 7, 50)-net over F49, using
- net from sequence [i] based on digital (0, 49)-sequence over F49 (see above)
- digital (0, 15, 50)-net over F49, using
- net from sequence [i] based on digital (0, 49)-sequence over F49 (see above)
- digital (0, 1, 50)-net over F49, using
(23, 23+15, 4883)-Net over F49 — Digital
Digital (23, 38, 4883)-net over F49, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(4938, 4883, F49, 15) (dual of [4883, 4845, 16]-code), using
- 2471 step Varšamov–Edel lengthening with (ri) = (3, 0, 1, 8 times 0, 1, 35 times 0, 1, 123 times 0, 1, 365 times 0, 1, 771 times 0, 1, 1161 times 0) [i] based on linear OA(4929, 2403, F49, 15) (dual of [2403, 2374, 16]-code), using
- construction X applied to Ce(14) ⊂ Ce(13) [i] based on
- linear OA(4929, 2401, F49, 15) (dual of [2401, 2372, 16]-code), using an extension Ce(14) of the primitive narrow-sense BCH-code C(I) with length 2400 = 492−1, defining interval I = [1,14], and designed minimum distance d ≥ |I|+1 = 15 [i]
- linear OA(4927, 2401, F49, 14) (dual of [2401, 2374, 15]-code), using an extension Ce(13) of the primitive narrow-sense BCH-code C(I) with length 2400 = 492−1, defining interval I = [1,13], and designed minimum distance d ≥ |I|+1 = 14 [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(14) ⊂ Ce(13) [i] based on
- 2471 step Varšamov–Edel lengthening with (ri) = (3, 0, 1, 8 times 0, 1, 35 times 0, 1, 123 times 0, 1, 365 times 0, 1, 771 times 0, 1, 1161 times 0) [i] based on linear OA(4929, 2403, F49, 15) (dual of [2403, 2374, 16]-code), using
(23, 23+15, large)-Net in Base 49 — Upper bound on s
There is no (23, 38, large)-net in base 49, because
- 13 times m-reduction [i] would yield (23, 25, large)-net in base 49, but