Best Known (87, 109, s)-Nets in Base 4
(87, 109, 1056)-Net over F4 — Constructive and digital
Digital (87, 109, 1056)-net over F4, using
- (u, u+v)-construction [i] based on
- digital (10, 21, 28)-net over F4, using
- (u, u+v)-construction [i] based on
- digital (2, 7, 16)-net over F4, using
- digital (3, 14, 14)-net over F4, using
- net from sequence [i] based on digital (3, 13)-sequence over F4, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F4 with g(F) = 3 and N(F) ≥ 14, using
- net from sequence [i] based on digital (3, 13)-sequence over F4, using
- (u, u+v)-construction [i] based on
- digital (66, 88, 1028)-net over F4, using
- trace code for nets [i] based on digital (0, 22, 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, 22, 257)-net over F256, using
- digital (10, 21, 28)-net over F4, using
(87, 109, 4328)-Net over F4 — Digital
Digital (87, 109, 4328)-net over F4, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(4109, 4328, F4, 22) (dual of [4328, 4219, 23]-code), using
- 214 step Varšamov–Edel lengthening with (ri) = (3, 1, 1, 0, 0, 1, 4 times 0, 1, 7 times 0, 1, 12 times 0, 1, 20 times 0, 1, 32 times 0, 1, 50 times 0, 1, 77 times 0) [i] based on linear OA(497, 4102, F4, 22) (dual of [4102, 4005, 23]-code), using
- construction X applied to Ce(21) ⊂ Ce(20) [i] based on
- linear OA(497, 4096, F4, 22) (dual of [4096, 3999, 23]-code), using an extension Ce(21) of the primitive narrow-sense BCH-code C(I) with length 4095 = 46−1, defining interval I = [1,21], and designed minimum distance d ≥ |I|+1 = 22 [i]
- linear OA(491, 4096, F4, 21) (dual of [4096, 4005, 22]-code), using an extension Ce(20) of the primitive narrow-sense BCH-code C(I) with length 4095 = 46−1, defining interval I = [1,20], and designed minimum distance d ≥ |I|+1 = 21 [i]
- linear OA(40, 6, F4, 0) (dual of [6, 6, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(40, s, F4, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- construction X applied to Ce(21) ⊂ Ce(20) [i] based on
- 214 step Varšamov–Edel lengthening with (ri) = (3, 1, 1, 0, 0, 1, 4 times 0, 1, 7 times 0, 1, 12 times 0, 1, 20 times 0, 1, 32 times 0, 1, 50 times 0, 1, 77 times 0) [i] based on linear OA(497, 4102, F4, 22) (dual of [4102, 4005, 23]-code), using
(87, 109, 1512716)-Net in Base 4 — Upper bound on s
There is no (87, 109, 1512717)-net in base 4, because
- the generalized Rao bound for nets shows that 4m ≥ 421250 099625 157688 802863 153225 732080 303942 036819 474819 725234 282460 > 4109 [i]