Best Known (33−17, 33, s)-Nets in Base 25
(33−17, 33, 132)-Net over F25 — Constructive and digital
Digital (16, 33, 132)-net over F25, using
- (u, u+v)-construction [i] based on
- digital (4, 12, 66)-net over F25, using
- net from sequence [i] based on digital (4, 65)-sequence over F25, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F25 with g(F) = 4 and N(F) ≥ 66, using
- net from sequence [i] based on digital (4, 65)-sequence over F25, using
- digital (4, 21, 66)-net over F25, using
- net from sequence [i] based on digital (4, 65)-sequence over F25 (see above)
- digital (4, 12, 66)-net over F25, using
(33−17, 33, 307)-Net over F25 — Digital
Digital (16, 33, 307)-net over F25, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OOA(2533, 307, F25, 2, 17) (dual of [(307, 2), 581, 18]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(2533, 314, F25, 2, 17) (dual of [(314, 2), 595, 18]-NRT-code), using
- OOA 2-folding [i] based on linear OA(2533, 628, F25, 17) (dual of [628, 595, 18]-code), using
- construction XX applied to C1 = C([623,14]), C2 = C([0,15]), C3 = C1 + C2 = C([0,14]), and C∩ = C1 ∩ C2 = C([623,15]) [i] based on
- linear OA(2531, 624, F25, 16) (dual of [624, 593, 17]-code), using the primitive BCH-code C(I) with length 624 = 252−1, defining interval I = {−1,0,…,14}, and designed minimum distance d ≥ |I|+1 = 17 [i]
- linear OA(2531, 624, F25, 16) (dual of [624, 593, 17]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 252−1, defining interval I = [0,15], and designed minimum distance d ≥ |I|+1 = 17 [i]
- linear OA(2533, 624, F25, 17) (dual of [624, 591, 18]-code), using the primitive BCH-code C(I) with length 624 = 252−1, defining interval I = {−1,0,…,15}, and designed minimum distance d ≥ |I|+1 = 18 [i]
- linear OA(2529, 624, F25, 15) (dual of [624, 595, 16]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 252−1, defining interval I = [0,14], and designed minimum distance d ≥ |I|+1 = 16 [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,14]), C2 = C([0,15]), C3 = C1 + C2 = C([0,14]), and C∩ = C1 ∩ C2 = C([623,15]) [i] based on
- OOA 2-folding [i] based on linear OA(2533, 628, F25, 17) (dual of [628, 595, 18]-code), using
- discarding factors / shortening the dual code based on linear OOA(2533, 314, F25, 2, 17) (dual of [(314, 2), 595, 18]-NRT-code), using
(33−17, 33, 61264)-Net in Base 25 — Upper bound on s
There is no (16, 33, 61265)-net in base 25, because
- 1 times m-reduction [i] would yield (16, 32, 61265)-net in base 25, but
- the generalized Rao bound for nets shows that 25m ≥ 542 108593 943507 972029 664655 414861 798198 178753 > 2532 [i]