Best Known (62−17, 62, s)-Nets in Base 5
(62−17, 62, 258)-Net over F5 — Constructive and digital
Digital (45, 62, 258)-net over F5, using
- (u, u+v)-construction [i] based on
- digital (0, 8, 6)-net over F5, using
- net from sequence [i] based on digital (0, 5)-sequence over F5, using
- Faure sequence [i]
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F5 with g(F) = 0 and N(F) ≥ 6, using
- the rational function field F5(x) [i]
- Niederreiter sequence [i]
- net from sequence [i] based on digital (0, 5)-sequence over F5, using
- digital (37, 54, 252)-net over F5, using
- trace code for nets [i] based on digital (10, 27, 126)-net over F25, using
- net from sequence [i] based on digital (10, 125)-sequence over F25, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F25 with g(F) = 10 and N(F) ≥ 126, using
- the Hermitian function field over F25 [i]
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F25 with g(F) = 10 and N(F) ≥ 126, using
- net from sequence [i] based on digital (10, 125)-sequence over F25, using
- trace code for nets [i] based on digital (10, 27, 126)-net over F25, using
- digital (0, 8, 6)-net over F5, using
(62−17, 62, 879)-Net over F5 — Digital
Digital (45, 62, 879)-net over F5, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(562, 879, F5, 17) (dual of [879, 817, 18]-code), using
- 241 step Varšamov–Edel lengthening with (ri) = (2, 1, 0, 0, 1, 6 times 0, 1, 13 times 0, 1, 27 times 0, 1, 45 times 0, 1, 63 times 0, 1, 77 times 0) [i] based on linear OA(553, 629, F5, 17) (dual of [629, 576, 18]-code), using
- construction X applied to Ce(16) ⊂ Ce(15) [i] based on
- linear OA(553, 625, F5, 17) (dual of [625, 572, 18]-code), using an extension Ce(16) of the primitive narrow-sense BCH-code C(I) with length 624 = 54−1, defining interval I = [1,16], and designed minimum distance d ≥ |I|+1 = 17 [i]
- linear OA(549, 625, F5, 16) (dual of [625, 576, 17]-code), using an extension Ce(15) of the primitive narrow-sense BCH-code C(I) with length 624 = 54−1, defining interval I = [1,15], and designed minimum distance d ≥ |I|+1 = 16 [i]
- linear OA(50, 4, F5, 0) (dual of [4, 4, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(50, s, F5, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- construction X applied to Ce(16) ⊂ Ce(15) [i] based on
- 241 step Varšamov–Edel lengthening with (ri) = (2, 1, 0, 0, 1, 6 times 0, 1, 13 times 0, 1, 27 times 0, 1, 45 times 0, 1, 63 times 0, 1, 77 times 0) [i] based on linear OA(553, 629, F5, 17) (dual of [629, 576, 18]-code), using
(62−17, 62, 201031)-Net in Base 5 — Upper bound on s
There is no (45, 62, 201032)-net in base 5, because
- 1 times m-reduction [i] would yield (45, 61, 201032)-net in base 5, but
- the generalized Rao bound for nets shows that 5m ≥ 4 336866 022556 388982 766459 151459 707768 679425 > 561 [i]