Best Known (33, 33+29, s)-Nets in Base 256
(33, 33+29, 4682)-Net over F256 — Constructive and digital
Digital (33, 62, 4682)-net over F256, using
- 2561 times duplication [i] based on digital (32, 61, 4682)-net over F256, using
- net defined by OOA [i] based on linear OOA(25661, 4682, F256, 29, 29) (dual of [(4682, 29), 135717, 30]-NRT-code), using
- OOA 14-folding and stacking with additional row [i] based on linear OA(25661, 65549, F256, 29) (dual of [65549, 65488, 30]-code), using
- discarding factors / shortening the dual code based on linear OA(25661, 65550, F256, 29) (dual of [65550, 65489, 30]-code), using
- construction X applied to Ce(28) ⊂ Ce(23) [i] based on
- linear OA(25657, 65536, F256, 29) (dual of [65536, 65479, 30]-code), using an extension Ce(28) of the primitive narrow-sense BCH-code C(I) with length 65535 = 2562−1, defining interval I = [1,28], and designed minimum distance d ≥ |I|+1 = 29 [i]
- linear OA(25647, 65536, F256, 24) (dual of [65536, 65489, 25]-code), using an extension Ce(23) of the primitive narrow-sense BCH-code C(I) with length 65535 = 2562−1, defining interval I = [1,23], and designed minimum distance d ≥ |I|+1 = 24 [i]
- linear OA(2564, 14, F256, 4) (dual of [14, 10, 5]-code or 14-arc in PG(3,256)), using
- discarding factors / shortening the dual code based on linear OA(2564, 256, F256, 4) (dual of [256, 252, 5]-code or 256-arc in PG(3,256)), using
- Reed–Solomon code RS(252,256) [i]
- discarding factors / shortening the dual code based on linear OA(2564, 256, F256, 4) (dual of [256, 252, 5]-code or 256-arc in PG(3,256)), using
- construction X applied to Ce(28) ⊂ Ce(23) [i] based on
- discarding factors / shortening the dual code based on linear OA(25661, 65550, F256, 29) (dual of [65550, 65489, 30]-code), using
- OOA 14-folding and stacking with additional row [i] based on linear OA(25661, 65549, F256, 29) (dual of [65549, 65488, 30]-code), using
- net defined by OOA [i] based on linear OOA(25661, 4682, F256, 29, 29) (dual of [(4682, 29), 135717, 30]-NRT-code), using
(33, 33+29, 19243)-Net over F256 — Digital
Digital (33, 62, 19243)-net over F256, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OOA(25662, 19243, F256, 3, 29) (dual of [(19243, 3), 57667, 30]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(25662, 21851, F256, 3, 29) (dual of [(21851, 3), 65491, 30]-NRT-code), using
- OOA 3-folding [i] based on linear OA(25662, 65553, F256, 29) (dual of [65553, 65491, 30]-code), using
- discarding factors / shortening the dual code based on linear OA(25662, 65554, F256, 29) (dual of [65554, 65492, 30]-code), using
- construction X applied to C([0,14]) ⊂ C([0,11]) [i] based on
- linear OA(25657, 65537, F256, 29) (dual of [65537, 65480, 30]-code), using the expurgated narrow-sense BCH-code C(I) with length 65537 | 2564−1, defining interval I = [0,14], and minimum distance d ≥ |{−14,−13,…,14}|+1 = 30 (BCH-bound) [i]
- linear OA(25645, 65537, F256, 23) (dual of [65537, 65492, 24]-code), using the expurgated narrow-sense BCH-code C(I) with length 65537 | 2564−1, defining interval I = [0,11], and minimum distance d ≥ |{−11,−10,…,11}|+1 = 24 (BCH-bound) [i]
- linear OA(2565, 17, F256, 5) (dual of [17, 12, 6]-code or 17-arc in PG(4,256)), using
- discarding factors / shortening the dual code based on linear OA(2565, 256, F256, 5) (dual of [256, 251, 6]-code or 256-arc in PG(4,256)), using
- Reed–Solomon code RS(251,256) [i]
- discarding factors / shortening the dual code based on linear OA(2565, 256, F256, 5) (dual of [256, 251, 6]-code or 256-arc in PG(4,256)), using
- construction X applied to C([0,14]) ⊂ C([0,11]) [i] based on
- discarding factors / shortening the dual code based on linear OA(25662, 65554, F256, 29) (dual of [65554, 65492, 30]-code), using
- OOA 3-folding [i] based on linear OA(25662, 65553, F256, 29) (dual of [65553, 65491, 30]-code), using
- discarding factors / shortening the dual code based on linear OOA(25662, 21851, F256, 3, 29) (dual of [(21851, 3), 65491, 30]-NRT-code), using
(33, 33+29, large)-Net in Base 256 — Upper bound on s
There is no (33, 62, large)-net in base 256, because
- 27 times m-reduction [i] would yield (33, 35, large)-net in base 256, but