Best Known (10, 91, s)-Nets in Base 5
(10, 91, 26)-Net over F5 — Constructive and digital
Digital (10, 91, 26)-net over F5, using
- t-expansion [i] based on digital (9, 91, 26)-net over F5, using
- net from sequence [i] based on digital (9, 25)-sequence over F5, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F5 with g(F) = 9 and N(F) ≥ 26, using
- net from sequence [i] based on digital (9, 25)-sequence over F5, using
(10, 91, 27)-Net over F5 — Digital
Digital (10, 91, 27)-net over F5, using
- net from sequence [i] based on digital (10, 26)-sequence over F5, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F5 with g(F) = 10 and N(F) ≥ 27, using
(10, 91, 58)-Net over F5 — Upper bound on s (digital)
There is no digital (10, 91, 59)-net over F5, because
- 41 times m-reduction [i] would yield digital (10, 50, 59)-net over F5, but
- extracting embedded orthogonal array [i] would yield linear OA(550, 59, F5, 40) (dual of [59, 9, 41]-code), but
- construction Y1 [i] would yield
- linear OA(549, 53, F5, 40) (dual of [53, 4, 41]-code), but
- residual code [i] would yield linear OA(59, 12, F5, 8) (dual of [12, 3, 9]-code), but
- OA(59, 59, S5, 6), but
- discarding factors would yield OA(59, 58, S5, 6), but
- the Rao or (dual) Hamming bound shows that M ≥ 2 001465 > 59 [i]
- discarding factors would yield OA(59, 58, S5, 6), but
- linear OA(549, 53, F5, 40) (dual of [53, 4, 41]-code), but
- construction Y1 [i] would yield
- extracting embedded orthogonal array [i] would yield linear OA(550, 59, F5, 40) (dual of [59, 9, 41]-code), but
(10, 91, 59)-Net in Base 5 — Upper bound on s
There is no (10, 91, 60)-net in base 5, because
- 37 times m-reduction [i] would yield (10, 54, 60)-net in base 5, but
- extracting embedded orthogonal array [i] would yield OA(554, 60, S5, 44), but
- the linear programming bound shows that M ≥ 6938 893903 907228 377647 697925 567626 953125 / 117 > 554 [i]
- extracting embedded orthogonal array [i] would yield OA(554, 60, S5, 44), but