Best Known (32, 58, s)-Nets in Base 25
(32, 58, 230)-Net over F25 — Constructive and digital
Digital (32, 58, 230)-net over F25, using
- (u, u+v)-construction [i] based on
- digital (9, 22, 104)-net over F25, using
- net from sequence [i] based on digital (9, 103)-sequence over F25, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F25 with g(F) = 9 and N(F) ≥ 104, using
- net from sequence [i] based on digital (9, 103)-sequence over F25, using
- digital (10, 36, 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
- digital (9, 22, 104)-net over F25, using
(32, 58, 766)-Net over F25 — Digital
Digital (32, 58, 766)-net over F25, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(2558, 766, F25, 26) (dual of [766, 708, 27]-code), using
- 132 step Varšamov–Edel lengthening with (ri) = (4, 1, 0, 0, 1, 7 times 0, 1, 17 times 0, 1, 36 times 0, 1, 64 times 0) [i] based on linear OA(2549, 625, F25, 26) (dual of [625, 576, 27]-code), using
- an extension Ce(25) of the primitive narrow-sense BCH-code C(I) with length 624 = 252−1, defining interval I = [1,25], and designed minimum distance d ≥ |I|+1 = 26 [i]
- 132 step Varšamov–Edel lengthening with (ri) = (4, 1, 0, 0, 1, 7 times 0, 1, 17 times 0, 1, 36 times 0, 1, 64 times 0) [i] based on linear OA(2549, 625, F25, 26) (dual of [625, 576, 27]-code), using
(32, 58, 407522)-Net in Base 25 — Upper bound on s
There is no (32, 58, 407523)-net in base 25, because
- the generalized Rao bound for nets shows that 25m ≥ 1203 743830 721747 701398 104960 202812 206715 410724 183678 160508 014228 194856 726485 780905 > 2558 [i]