Best Known (45, 58, s)-Nets in Base 2
(45, 58, 98)-Net over F2 — Constructive and digital
Digital (45, 58, 98)-net over F2, using
- (u, u+v)-construction [i] based on
- digital (11, 17, 48)-net over F2, using
- digital (28, 41, 50)-net over F2, using
- (u, u+v)-construction [i] based on
(45, 58, 206)-Net over F2 — Digital
Digital (45, 58, 206)-net over F2, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OOA(258, 206, F2, 2, 13) (dual of [(206, 2), 354, 14]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(258, 266, F2, 2, 13) (dual of [(266, 2), 474, 14]-NRT-code), using
- OOA 2-folding [i] based on linear OA(258, 532, F2, 13) (dual of [532, 474, 14]-code), using
- discarding factors / shortening the dual code based on linear OA(258, 533, F2, 13) (dual of [533, 475, 14]-code), using
- adding a parity check bit [i] based on linear OA(257, 532, F2, 12) (dual of [532, 475, 13]-code), using
- construction XX applied to C1 = C([509,8]), C2 = C([1,10]), C3 = C1 + C2 = C([1,8]), and C∩ = C1 ∩ C2 = C([509,10]) [i] based on
- linear OA(246, 511, F2, 11) (dual of [511, 465, 12]-code), using the primitive BCH-code C(I) with length 511 = 29−1, defining interval I = {−2,−1,…,8}, and designed minimum distance d ≥ |I|+1 = 12 [i]
- linear OA(245, 511, F2, 10) (dual of [511, 466, 11]-code), using the primitive narrow-sense BCH-code C(I) with length 511 = 29−1, defining interval I = [1,10], and designed minimum distance d ≥ |I|+1 = 11 [i]
- linear OA(255, 511, F2, 13) (dual of [511, 456, 14]-code), using the primitive BCH-code C(I) with length 511 = 29−1, defining interval I = {−2,−1,…,10}, and designed minimum distance d ≥ |I|+1 = 14 [i]
- linear OA(236, 511, F2, 8) (dual of [511, 475, 9]-code), using the primitive narrow-sense BCH-code C(I) with length 511 = 29−1, defining interval I = [1,8], and designed minimum distance d ≥ |I|+1 = 9 [i]
- 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, using
- linear OA(21, 10, F2, 1) (dual of [10, 9, 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([509,8]), C2 = C([1,10]), C3 = C1 + C2 = C([1,8]), and C∩ = C1 ∩ C2 = C([509,10]) [i] based on
- adding a parity check bit [i] based on linear OA(257, 532, F2, 12) (dual of [532, 475, 13]-code), using
- discarding factors / shortening the dual code based on linear OA(258, 533, F2, 13) (dual of [533, 475, 14]-code), using
- OOA 2-folding [i] based on linear OA(258, 532, F2, 13) (dual of [532, 474, 14]-code), using
- discarding factors / shortening the dual code based on linear OOA(258, 266, F2, 2, 13) (dual of [(266, 2), 474, 14]-NRT-code), using
(45, 58, 2159)-Net in Base 2 — Upper bound on s
There is no (45, 58, 2160)-net in base 2, because
- 1 times m-reduction [i] would yield (45, 57, 2160)-net in base 2, but
- the generalized Rao bound for nets shows that 2m ≥ 144413 123256 786133 > 257 [i]