Best Known (12, 12+17, s)-Nets in Base 256
(12, 12+17, 518)-Net over F256 — Constructive and digital
Digital (12, 29, 518)-net over F256, using
- (u, u+v)-construction [i] based on
- digital (2, 10, 259)-net over F256, using
- net from sequence [i] based on digital (2, 258)-sequence over F256, using
- digital (2, 19, 259)-net over F256, using
- net from sequence [i] based on digital (2, 258)-sequence over F256 (see above)
- digital (2, 10, 259)-net over F256, using
(12, 12+17, 776)-Net over F256 — Digital
Digital (12, 29, 776)-net over F256, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(25629, 776, F256, 17) (dual of [776, 747, 18]-code), using
- construction XX applied to C1 = C([121,136]), C2 = C([120,134]), C3 = C1 + C2 = C([121,134]), and C∩ = C1 ∩ C2 = C([120,136]) [i] based on
- linear OA(25626, 771, F256, 16) (dual of [771, 745, 17]-code), using the BCH-code C(I) with length 771 | 2562−1, defining interval I = {121,122,…,136}, and designed minimum distance d ≥ |I|+1 = 17 [i]
- linear OA(25626, 771, F256, 15) (dual of [771, 745, 16]-code), using the BCH-code C(I) with length 771 | 2562−1, defining interval I = {120,121,…,134}, and designed minimum distance d ≥ |I|+1 = 16 [i]
- linear OA(25628, 771, F256, 17) (dual of [771, 743, 18]-code), using the BCH-code C(I) with length 771 | 2562−1, defining interval I = {120,121,…,136}, and designed minimum distance d ≥ |I|+1 = 18 [i]
- linear OA(25624, 771, F256, 14) (dual of [771, 747, 15]-code), using the BCH-code C(I) with length 771 | 2562−1, defining interval I = {121,122,…,134}, and designed minimum distance d ≥ |I|+1 = 15 [i]
- linear OA(2561, 3, F256, 1) (dual of [3, 2, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(2561, 256, F256, 1) (dual of [256, 255, 2]-code), using
- Reed–Solomon code RS(255,256) [i]
- discarding factors / shortening the dual code based on linear OA(2561, 256, F256, 1) (dual of [256, 255, 2]-code), using
- linear OA(2560, 2, F256, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(2560, s, F256, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- construction XX applied to C1 = C([121,136]), C2 = C([120,134]), C3 = C1 + C2 = C([121,134]), and C∩ = C1 ∩ C2 = C([120,136]) [i] based on
(12, 12+17, 3962683)-Net in Base 256 — Upper bound on s
There is no (12, 29, 3962684)-net in base 256, because
- 1 times m-reduction [i] would yield (12, 28, 3962684)-net in base 256, but
- the generalized Rao bound for nets shows that 256m ≥ 26 959978 849535 370862 030784 589633 334965 690662 236454 170813 366837 063111 > 25628 [i]