Best Known (46, 61, s)-Nets in Base 2
(46, 61, 88)-Net over F2 — Constructive and digital
Digital (46, 61, 88)-net over F2, using
- (u, u+v)-construction [i] based on
- digital (12, 19, 47)-net over F2, using
- digital (27, 42, 44)-net over F2, using
- 2 times m-reduction [i] based on digital (27, 44, 44)-net over F2, using
(46, 61, 138)-Net over F2 — Digital
Digital (46, 61, 138)-net over F2, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OOA(261, 138, F2, 2, 15) (dual of [(138, 2), 215, 16]-NRT-code), using
- OOA 2-folding [i] based on linear OA(261, 276, F2, 15) (dual of [276, 215, 16]-code), using
- 1 times code embedding in larger space [i] based on linear OA(260, 275, F2, 15) (dual of [275, 215, 16]-code), using
- adding a parity check bit [i] based on linear OA(259, 274, F2, 14) (dual of [274, 215, 15]-code), using
- construction XX applied to C1 = C([253,10]), C2 = C([1,12]), C3 = C1 + C2 = C([1,10]), and C∩ = C1 ∩ C2 = C([253,12]) [i] based on
- linear OA(249, 255, F2, 13) (dual of [255, 206, 14]-code), using the primitive BCH-code C(I) with length 255 = 28−1, defining interval I = {−2,−1,…,10}, and designed minimum distance d ≥ |I|+1 = 14 [i]
- linear OA(248, 255, F2, 12) (dual of [255, 207, 13]-code), using the primitive narrow-sense BCH-code C(I) with length 255 = 28−1, defining interval I = [1,12], and designed minimum distance d ≥ |I|+1 = 13 [i]
- linear OA(257, 255, F2, 15) (dual of [255, 198, 16]-code), using the primitive BCH-code C(I) with length 255 = 28−1, defining interval I = {−2,−1,…,12}, and designed minimum distance d ≥ |I|+1 = 16 [i]
- linear OA(240, 255, F2, 10) (dual of [255, 215, 11]-code), using the primitive narrow-sense BCH-code C(I) with length 255 = 28−1, defining interval I = [1,10], and designed minimum distance d ≥ |I|+1 = 11 [i]
- 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, using
- linear OA(21, 9, F2, 1) (dual of [9, 8, 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([253,10]), C2 = C([1,12]), C3 = C1 + C2 = C([1,10]), and C∩ = C1 ∩ C2 = C([253,12]) [i] based on
- adding a parity check bit [i] based on linear OA(259, 274, F2, 14) (dual of [274, 215, 15]-code), using
- 1 times code embedding in larger space [i] based on linear OA(260, 275, F2, 15) (dual of [275, 215, 16]-code), using
- OOA 2-folding [i] based on linear OA(261, 276, F2, 15) (dual of [276, 215, 16]-code), using
(46, 61, 1275)-Net in Base 2 — Upper bound on s
There is no (46, 61, 1276)-net in base 2, because
- 1 times m-reduction [i] would yield (46, 60, 1276)-net in base 2, but
- the generalized Rao bound for nets shows that 2m ≥ 1 153919 883103 200698 > 260 [i]