Best Known (203, 203+23, s)-Nets in Base 3
(203, 203+23, 762600)-Net over F3 — Constructive and digital
Digital (203, 226, 762600)-net over F3, using
- net defined by OOA [i] based on linear OOA(3226, 762600, F3, 23, 23) (dual of [(762600, 23), 17539574, 24]-NRT-code), using
- OOA 11-folding and stacking with additional row [i] based on linear OA(3226, 8388601, F3, 23) (dual of [8388601, 8388375, 24]-code), using
- discarding factors / shortening the dual code based on linear OA(3226, large, F3, 23) (dual of [large, large−226, 24]-code), using
- the primitive expurgated narrow-sense BCH-code C(I) with length 14348906 = 315−1, defining interval I = [0,22], and designed minimum distance d ≥ |I|+1 = 24 [i]
- discarding factors / shortening the dual code based on linear OA(3226, large, F3, 23) (dual of [large, large−226, 24]-code), using
- OOA 11-folding and stacking with additional row [i] based on linear OA(3226, 8388601, F3, 23) (dual of [8388601, 8388375, 24]-code), using
(203, 203+23, 2097150)-Net over F3 — Digital
Digital (203, 226, 2097150)-net over F3, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OOA(3226, 2097150, F3, 4, 23) (dual of [(2097150, 4), 8388374, 24]-NRT-code), using
- OOA 4-folding [i] based on linear OA(3226, 8388600, F3, 23) (dual of [8388600, 8388374, 24]-code), using
- discarding factors / shortening the dual code based on linear OA(3226, large, F3, 23) (dual of [large, large−226, 24]-code), using
- the primitive expurgated narrow-sense BCH-code C(I) with length 14348906 = 315−1, defining interval I = [0,22], and designed minimum distance d ≥ |I|+1 = 24 [i]
- discarding factors / shortening the dual code based on linear OA(3226, large, F3, 23) (dual of [large, large−226, 24]-code), using
- OOA 4-folding [i] based on linear OA(3226, 8388600, F3, 23) (dual of [8388600, 8388374, 24]-code), using
(203, 203+23, large)-Net in Base 3 — Upper bound on s
There is no (203, 226, large)-net in base 3, because
- 21 times m-reduction [i] would yield (203, 205, large)-net in base 3, but