Best Known (33−9, 33, s)-Nets in Base 5
(33−9, 33, 208)-Net over F5 — Constructive and digital
Digital (24, 33, 208)-net over F5, using
- (u, u+v)-construction [i] based on
- digital (5, 9, 137)-net over F5, using
- digital (15, 24, 104)-net over F5, using
- trace code for nets [i] based on digital (3, 12, 52)-net over F25, using
- net from sequence [i] based on digital (3, 51)-sequence over F25, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F25 with g(F) = 3 and N(F) ≥ 52, using
- net from sequence [i] based on digital (3, 51)-sequence over F25, using
- trace code for nets [i] based on digital (3, 12, 52)-net over F25, using
(33−9, 33, 751)-Net over F5 — Digital
Digital (24, 33, 751)-net over F5, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(533, 751, F5, 9) (dual of [751, 718, 10]-code), using
- 111 step Varšamov–Edel lengthening with (ri) = (1, 5 times 0, 1, 26 times 0, 1, 77 times 0) [i] based on linear OA(530, 637, F5, 9) (dual of [637, 607, 10]-code), using
- construction XX applied to C1 = C([622,5]), C2 = C([0,6]), C3 = C1 + C2 = C([0,5]), and C∩ = C1 ∩ C2 = C([622,6]) [i] based on
- linear OA(525, 624, F5, 8) (dual of [624, 599, 9]-code), using the primitive BCH-code C(I) with length 624 = 54−1, defining interval I = {−2,−1,…,5}, and designed minimum distance d ≥ |I|+1 = 9 [i]
- linear OA(521, 624, F5, 7) (dual of [624, 603, 8]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 54−1, defining interval I = [0,6], and designed minimum distance d ≥ |I|+1 = 8 [i]
- linear OA(529, 624, F5, 9) (dual of [624, 595, 10]-code), using the primitive BCH-code C(I) with length 624 = 54−1, defining interval I = {−2,−1,…,6}, and designed minimum distance d ≥ |I|+1 = 10 [i]
- linear OA(517, 624, F5, 6) (dual of [624, 607, 7]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 54−1, defining interval I = [0,5], and designed minimum distance d ≥ |I|+1 = 7 [i]
- linear OA(51, 9, F5, 1) (dual of [9, 8, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(51, s, F5, 1) (dual of [s, s−1, 2]-code) with arbitrarily large s, using
- 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 XX applied to C1 = C([622,5]), C2 = C([0,6]), C3 = C1 + C2 = C([0,5]), and C∩ = C1 ∩ C2 = C([622,6]) [i] based on
- 111 step Varšamov–Edel lengthening with (ri) = (1, 5 times 0, 1, 26 times 0, 1, 77 times 0) [i] based on linear OA(530, 637, F5, 9) (dual of [637, 607, 10]-code), using
(33−9, 33, 216146)-Net in Base 5 — Upper bound on s
There is no (24, 33, 216147)-net in base 5, because
- 1 times m-reduction [i] would yield (24, 32, 216147)-net in base 5, but
- the generalized Rao bound for nets shows that 5m ≥ 23283 360610 856705 955185 > 532 [i]