Best Known (93, 93+23, s)-Nets in Base 4
(93, 93+23, 1076)-Net over F4 — Constructive and digital
Digital (93, 116, 1076)-net over F4, using
- (u, u+v)-construction [i] based on
- digital (13, 24, 48)-net over F4, using
- trace code for nets [i] based on digital (1, 12, 24)-net over F16, using
- net from sequence [i] based on digital (1, 23)-sequence over F16, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F16 with g(F) = 1 and N(F) ≥ 24, using
- net from sequence [i] based on digital (1, 23)-sequence over F16, using
- trace code for nets [i] based on digital (1, 12, 24)-net over F16, using
- digital (69, 92, 1028)-net over F4, using
- trace code for nets [i] based on digital (0, 23, 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, 23, 257)-net over F256, using
- digital (13, 24, 48)-net over F4, using
(93, 93+23, 4661)-Net over F4 — Digital
Digital (93, 116, 4661)-net over F4, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(4116, 4661, F4, 23) (dual of [4661, 4545, 24]-code), using
- 546 step Varšamov–Edel lengthening with (ri) = (3, 1, 0, 0, 1, 4 times 0, 1, 8 times 0, 1, 14 times 0, 1, 23 times 0, 1, 37 times 0, 1, 58 times 0, 1, 88 times 0, 1, 127 times 0, 1, 174 times 0) [i] based on linear OA(4103, 4102, F4, 23) (dual of [4102, 3999, 24]-code), using
- construction X applied to Ce(22) ⊂ Ce(21) [i] based on
- linear OA(4103, 4096, F4, 23) (dual of [4096, 3993, 24]-code), using an extension Ce(22) of the primitive narrow-sense BCH-code C(I) with length 4095 = 46−1, defining interval I = [1,22], and designed minimum distance d ≥ |I|+1 = 23 [i]
- 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(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(22) ⊂ Ce(21) [i] based on
- 546 step Varšamov–Edel lengthening with (ri) = (3, 1, 0, 0, 1, 4 times 0, 1, 8 times 0, 1, 14 times 0, 1, 23 times 0, 1, 37 times 0, 1, 58 times 0, 1, 88 times 0, 1, 127 times 0, 1, 174 times 0) [i] based on linear OA(4103, 4102, F4, 23) (dual of [4102, 3999, 24]-code), using
(93, 93+23, 3222220)-Net in Base 4 — Upper bound on s
There is no (93, 116, 3222221)-net in base 4, because
- 1 times m-reduction [i] would yield (93, 115, 3222221)-net in base 4, but
- the generalized Rao bound for nets shows that 4m ≥ 1725 438538 478564 019479 408201 621072 106806 141719 309584 159939 306316 112764 > 4115 [i]