Best Known (35, 35+30, s)-Nets in Base 25
(35, 35+30, 252)-Net over F25 — Constructive and digital
Digital (35, 65, 252)-net over F25, using
- (u, u+v)-construction [i] based on
- digital (10, 25, 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 (10, 40, 126)-net over F25, using
- net from sequence [i] based on digital (10, 125)-sequence over F25 (see above)
- digital (10, 25, 126)-net over F25, using
(35, 35+30, 708)-Net over F25 — Digital
Digital (35, 65, 708)-net over F25, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(2565, 708, F25, 30) (dual of [708, 643, 31]-code), using
- 71 step Varšamov–Edel lengthening with (ri) = (5, 0, 1, 4 times 0, 1, 9 times 0, 1, 18 times 0, 1, 34 times 0) [i] based on linear OA(2556, 628, F25, 30) (dual of [628, 572, 31]-code), using
- construction XX applied to C1 = C([623,27]), C2 = C([0,28]), C3 = C1 + C2 = C([0,27]), and C∩ = C1 ∩ C2 = C([623,28]) [i] based on
- linear OA(2554, 624, F25, 29) (dual of [624, 570, 30]-code), using the primitive BCH-code C(I) with length 624 = 252−1, defining interval I = {−1,0,…,27}, and designed minimum distance d ≥ |I|+1 = 30 [i]
- linear OA(2554, 624, F25, 29) (dual of [624, 570, 30]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 252−1, defining interval I = [0,28], and designed minimum distance d ≥ |I|+1 = 30 [i]
- linear OA(2556, 624, F25, 30) (dual of [624, 568, 31]-code), using the primitive BCH-code C(I) with length 624 = 252−1, defining interval I = {−1,0,…,28}, and designed minimum distance d ≥ |I|+1 = 31 [i]
- linear OA(2552, 624, F25, 28) (dual of [624, 572, 29]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 252−1, defining interval I = [0,27], and designed minimum distance d ≥ |I|+1 = 29 [i]
- linear OA(250, 2, F25, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(250, s, F25, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- linear OA(250, 2, F25, 0) (dual of [2, 2, 1]-code) (see above)
- construction XX applied to C1 = C([623,27]), C2 = C([0,28]), C3 = C1 + C2 = C([0,27]), and C∩ = C1 ∩ C2 = C([623,28]) [i] based on
- 71 step Varšamov–Edel lengthening with (ri) = (5, 0, 1, 4 times 0, 1, 9 times 0, 1, 18 times 0, 1, 34 times 0) [i] based on linear OA(2556, 628, F25, 30) (dual of [628, 572, 31]-code), using
(35, 35+30, 305692)-Net in Base 25 — Upper bound on s
There is no (35, 65, 305693)-net in base 25, because
- the generalized Rao bound for nets shows that 25m ≥ 7 347065 524658 096257 008223 804568 371574 386665 115161 929404 490220 435888 279490 672358 986904 014729 > 2565 [i]