Best Known (61−26, 61, s)-Nets in Base 256
(61−26, 61, 5043)-Net over F256 — Constructive and digital
Digital (35, 61, 5043)-net over F256, using
- 2561 times duplication [i] based on digital (34, 60, 5043)-net over F256, using
- t-expansion [i] based on digital (33, 60, 5043)-net over F256, using
- net defined by OOA [i] based on linear OOA(25660, 5043, F256, 27, 27) (dual of [(5043, 27), 136101, 28]-NRT-code), using
- OOA 13-folding and stacking with additional row [i] based on linear OA(25660, 65560, F256, 27) (dual of [65560, 65500, 28]-code), using
- construction X applied to C([0,13]) ⊂ C([0,9]) [i] based on
- linear OA(25653, 65537, F256, 27) (dual of [65537, 65484, 28]-code), using the expurgated narrow-sense BCH-code C(I) with length 65537 | 2564−1, defining interval I = [0,13], and minimum distance d ≥ |{−13,−12,…,13}|+1 = 28 (BCH-bound) [i]
- linear OA(25637, 65537, F256, 19) (dual of [65537, 65500, 20]-code), using the expurgated narrow-sense BCH-code C(I) with length 65537 | 2564−1, defining interval I = [0,9], and minimum distance d ≥ |{−9,−8,…,9}|+1 = 20 (BCH-bound) [i]
- linear OA(2567, 23, F256, 7) (dual of [23, 16, 8]-code or 23-arc in PG(6,256)), using
- discarding factors / shortening the dual code based on linear OA(2567, 256, F256, 7) (dual of [256, 249, 8]-code or 256-arc in PG(6,256)), using
- Reed–Solomon code RS(249,256) [i]
- discarding factors / shortening the dual code based on linear OA(2567, 256, F256, 7) (dual of [256, 249, 8]-code or 256-arc in PG(6,256)), using
- construction X applied to C([0,13]) ⊂ C([0,9]) [i] based on
- OOA 13-folding and stacking with additional row [i] based on linear OA(25660, 65560, F256, 27) (dual of [65560, 65500, 28]-code), using
- net defined by OOA [i] based on linear OOA(25660, 5043, F256, 27, 27) (dual of [(5043, 27), 136101, 28]-NRT-code), using
- t-expansion [i] based on digital (33, 60, 5043)-net over F256, using
(61−26, 61, 40300)-Net over F256 — Digital
Digital (35, 61, 40300)-net over F256, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(25661, 40300, F256, 26) (dual of [40300, 40239, 27]-code), using
- discarding factors / shortening the dual code based on linear OA(25661, 65568, F256, 26) (dual of [65568, 65507, 27]-code), using
- construction X applied to Ce(25) ⊂ Ce(14) [i] based on
- linear OA(25651, 65536, F256, 26) (dual of [65536, 65485, 27]-code), using an extension Ce(25) of the primitive narrow-sense BCH-code C(I) with length 65535 = 2562−1, defining interval I = [1,25], and designed minimum distance d ≥ |I|+1 = 26 [i]
- linear OA(25629, 65536, F256, 15) (dual of [65536, 65507, 16]-code), using an extension Ce(14) of the primitive narrow-sense BCH-code C(I) with length 65535 = 2562−1, defining interval I = [1,14], and designed minimum distance d ≥ |I|+1 = 15 [i]
- linear OA(25610, 32, F256, 10) (dual of [32, 22, 11]-code or 32-arc in PG(9,256)), using
- discarding factors / shortening the dual code based on linear OA(25610, 256, F256, 10) (dual of [256, 246, 11]-code or 256-arc in PG(9,256)), using
- Reed–Solomon code RS(246,256) [i]
- discarding factors / shortening the dual code based on linear OA(25610, 256, F256, 10) (dual of [256, 246, 11]-code or 256-arc in PG(9,256)), using
- construction X applied to Ce(25) ⊂ Ce(14) [i] based on
- discarding factors / shortening the dual code based on linear OA(25661, 65568, F256, 26) (dual of [65568, 65507, 27]-code), using
(61−26, 61, large)-Net in Base 256 — Upper bound on s
There is no (35, 61, large)-net in base 256, because
- 24 times m-reduction [i] would yield (35, 37, large)-net in base 256, but