Best Known (64−27, 64, s)-Nets in Base 32
(64−27, 64, 240)-Net over F32 — Constructive and digital
Digital (37, 64, 240)-net over F32, using
- 3 times m-reduction [i] based on digital (37, 67, 240)-net over F32, using
- (u, u+v)-construction [i] based on
- digital (11, 26, 120)-net over F32, using
- net from sequence [i] based on digital (11, 119)-sequence over F32, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F32 with g(F) = 11 and N(F) ≥ 120, using
- net from sequence [i] based on digital (11, 119)-sequence over F32, using
- digital (11, 41, 120)-net over F32, using
- net from sequence [i] based on digital (11, 119)-sequence over F32 (see above)
- digital (11, 26, 120)-net over F32, using
- (u, u+v)-construction [i] based on
(64−27, 64, 514)-Net in Base 32 — Constructive
(37, 64, 514)-net in base 32, using
- base change [i] based on digital (13, 40, 514)-net over F256, using
- (u, u+v)-construction [i] based on
- digital (0, 13, 257)-net over F256, using
- net from sequence [i] based on digital (0, 256)-sequence over F256, using
- generalized Faure sequence [i]
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F256 with g(F) = 0 and N(F) ≥ 257, using
- the rational function field F256(x) [i]
- Niederreiter sequence [i]
- net from sequence [i] based on digital (0, 256)-sequence over F256, using
- digital (0, 27, 257)-net over F256, using
- net from sequence [i] based on digital (0, 256)-sequence over F256 (see above)
- digital (0, 13, 257)-net over F256, using
- (u, u+v)-construction [i] based on
(64−27, 64, 1739)-Net over F32 — Digital
Digital (37, 64, 1739)-net over F32, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(3264, 1739, F32, 27) (dual of [1739, 1675, 28]-code), using
- 701 step Varšamov–Edel lengthening with (ri) = (4, 0, 0, 1, 7 times 0, 1, 18 times 0, 1, 44 times 0, 1, 87 times 0, 1, 140 times 0, 1, 182 times 0, 1, 213 times 0) [i] based on linear OA(3253, 1027, F32, 27) (dual of [1027, 974, 28]-code), using
- construction XX applied to C1 = C([1022,24]), C2 = C([0,25]), C3 = C1 + C2 = C([0,24]), and C∩ = C1 ∩ C2 = C([1022,25]) [i] based on
- linear OA(3251, 1023, F32, 26) (dual of [1023, 972, 27]-code), using the primitive BCH-code C(I) with length 1023 = 322−1, defining interval I = {−1,0,…,24}, and designed minimum distance d ≥ |I|+1 = 27 [i]
- linear OA(3251, 1023, F32, 26) (dual of [1023, 972, 27]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 1023 = 322−1, defining interval I = [0,25], and designed minimum distance d ≥ |I|+1 = 27 [i]
- linear OA(3253, 1023, F32, 27) (dual of [1023, 970, 28]-code), using the primitive BCH-code C(I) with length 1023 = 322−1, defining interval I = {−1,0,…,25}, and designed minimum distance d ≥ |I|+1 = 28 [i]
- linear OA(3249, 1023, F32, 25) (dual of [1023, 974, 26]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 1023 = 322−1, defining interval I = [0,24], and designed minimum distance d ≥ |I|+1 = 26 [i]
- linear OA(320, 2, F32, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(320, s, F32, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- linear OA(320, 2, F32, 0) (dual of [2, 2, 1]-code) (see above)
- construction XX applied to C1 = C([1022,24]), C2 = C([0,25]), C3 = C1 + C2 = C([0,24]), and C∩ = C1 ∩ C2 = C([1022,25]) [i] based on
- 701 step Varšamov–Edel lengthening with (ri) = (4, 0, 0, 1, 7 times 0, 1, 18 times 0, 1, 44 times 0, 1, 87 times 0, 1, 140 times 0, 1, 182 times 0, 1, 213 times 0) [i] based on linear OA(3253, 1027, F32, 27) (dual of [1027, 974, 28]-code), using
(64−27, 64, 3599416)-Net in Base 32 — Upper bound on s
There is no (37, 64, 3599417)-net in base 32, because
- 1 times m-reduction [i] would yield (37, 63, 3599417)-net in base 32, but
- the generalized Rao bound for nets shows that 32m ≥ 66749 789101 170907 597051 351737 857413 736608 658439 041352 969868 971798 905526 568912 915589 555554 488720 > 3263 [i]