Best Known (60, 60+15, s)-Nets in Base 2
(60, 60+15, 165)-Net over F2 — Constructive and digital
Digital (60, 75, 165)-net over F2, using
- trace code for nets [i] based on digital (0, 15, 33)-net over F32, using
- net from sequence [i] based on digital (0, 32)-sequence over F32, using
- generalized Faure sequence [i]
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F32 with g(F) = 0 and N(F) ≥ 33, using
- the rational function field F32(x) [i]
- Niederreiter sequence [i]
- net from sequence [i] based on digital (0, 32)-sequence over F32, using
(60, 60+15, 349)-Net over F2 — Digital
Digital (60, 75, 349)-net over F2, using
- 21 times duplication [i] based on digital (59, 74, 349)-net over F2, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OOA(274, 349, F2, 3, 15) (dual of [(349, 3), 973, 16]-NRT-code), using
- OOA 3-folding [i] based on linear OA(274, 1047, F2, 15) (dual of [1047, 973, 16]-code), using
- adding a parity check bit [i] based on linear OA(273, 1046, F2, 14) (dual of [1046, 973, 15]-code), using
- construction XX applied to C1 = C([1021,10]), C2 = C([1,12]), C3 = C1 + C2 = C([1,10]), and C∩ = C1 ∩ C2 = C([1021,12]) [i] based on
- linear OA(261, 1023, F2, 13) (dual of [1023, 962, 14]-code), using the primitive BCH-code C(I) with length 1023 = 210−1, defining interval I = {−2,−1,…,10}, and designed minimum distance d ≥ |I|+1 = 14 [i]
- linear OA(260, 1023, F2, 12) (dual of [1023, 963, 13]-code), using the primitive narrow-sense BCH-code C(I) with length 1023 = 210−1, defining interval I = [1,12], and designed minimum distance d ≥ |I|+1 = 13 [i]
- linear OA(271, 1023, F2, 15) (dual of [1023, 952, 16]-code), using the primitive BCH-code C(I) with length 1023 = 210−1, defining interval I = {−2,−1,…,12}, and designed minimum distance d ≥ |I|+1 = 16 [i]
- linear OA(250, 1023, F2, 10) (dual of [1023, 973, 11]-code), using the primitive narrow-sense BCH-code C(I) with length 1023 = 210−1, defining interval I = [1,10], and designed minimum distance d ≥ |I|+1 = 11 [i]
- linear OA(21, 12, F2, 1) (dual of [12, 11, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(21, s, F2, 1) (dual of [s, s−1, 2]-code) with arbitrarily large s, using
- linear OA(21, 11, F2, 1) (dual of [11, 10, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(21, s, F2, 1) (dual of [s, s−1, 2]-code) with arbitrarily large s (see above)
- construction XX applied to C1 = C([1021,10]), C2 = C([1,12]), C3 = C1 + C2 = C([1,10]), and C∩ = C1 ∩ C2 = C([1021,12]) [i] based on
- adding a parity check bit [i] based on linear OA(273, 1046, F2, 14) (dual of [1046, 973, 15]-code), using
- OOA 3-folding [i] based on linear OA(274, 1047, F2, 15) (dual of [1047, 973, 16]-code), using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OOA(274, 349, F2, 3, 15) (dual of [(349, 3), 973, 16]-NRT-code), using
(60, 60+15, 5133)-Net in Base 2 — Upper bound on s
There is no (60, 75, 5134)-net in base 2, because
- 1 times m-reduction [i] would yield (60, 74, 5134)-net in base 2, but
- the generalized Rao bound for nets shows that 2m ≥ 18909 111925 541360 344192 > 274 [i]