Best Known (145−29, 145, s)-Nets in Base 4
(145−29, 145, 1062)-Net over F4 — Constructive and digital
Digital (116, 145, 1062)-net over F4, using
- 41 times duplication [i] based on digital (115, 144, 1062)-net over F4, using
- (u, u+v)-construction [i] based on
- digital (14, 28, 34)-net over F4, using
- trace code for nets [i] based on digital (0, 14, 17)-net over F16, using
- net from sequence [i] based on digital (0, 16)-sequence over F16, using
- generalized Faure sequence [i]
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F16 with g(F) = 0 and N(F) ≥ 17, using
- the rational function field F16(x) [i]
- Niederreiter sequence [i]
- net from sequence [i] based on digital (0, 16)-sequence over F16, using
- trace code for nets [i] based on digital (0, 14, 17)-net over F16, using
- digital (87, 116, 1028)-net over F4, using
- trace code for nets [i] based on digital (0, 29, 257)-net over F256, using
- net from sequence [i] based on digital (0, 256)-sequence over F256, using
- generalized Faure sequence [i]
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F256 with g(F) = 0 and N(F) ≥ 257, using
- the rational function field F256(x) [i]
- Niederreiter sequence [i]
- net from sequence [i] based on digital (0, 256)-sequence over F256, using
- trace code for nets [i] based on digital (0, 29, 257)-net over F256, using
- digital (14, 28, 34)-net over F4, using
- (u, u+v)-construction [i] based on
(145−29, 145, 4992)-Net over F4 — Digital
Digital (116, 145, 4992)-net over F4, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(4145, 4992, F4, 29) (dual of [4992, 4847, 30]-code), using
- 878 step Varšamov–Edel lengthening with (ri) = (4, 1, 1, 0, 0, 1, 4 times 0, 1, 6 times 0, 1, 11 times 0, 1, 18 times 0, 1, 27 times 0, 1, 40 times 0, 1, 58 times 0, 1, 80 times 0, 1, 107 times 0, 1, 138 times 0, 1, 170 times 0, 1, 202 times 0) [i] based on linear OA(4127, 4096, F4, 29) (dual of [4096, 3969, 30]-code), using
- an extension Ce(28) of the primitive narrow-sense BCH-code C(I) with length 4095 = 46−1, defining interval I = [1,28], and designed minimum distance d ≥ |I|+1 = 29 [i]
- 878 step Varšamov–Edel lengthening with (ri) = (4, 1, 1, 0, 0, 1, 4 times 0, 1, 6 times 0, 1, 11 times 0, 1, 18 times 0, 1, 27 times 0, 1, 40 times 0, 1, 58 times 0, 1, 80 times 0, 1, 107 times 0, 1, 138 times 0, 1, 170 times 0, 1, 202 times 0) [i] based on linear OA(4127, 4096, F4, 29) (dual of [4096, 3969, 30]-code), using
(145−29, 145, 3140161)-Net in Base 4 — Upper bound on s
There is no (116, 145, 3140162)-net in base 4, because
- 1 times m-reduction [i] would yield (116, 144, 3140162)-net in base 4, but
- the generalized Rao bound for nets shows that 4m ≥ 497 324194 779615 625161 073265 240907 174037 241918 940501 349130 560566 142345 878533 737431 769312 > 4144 [i]