Best Known (91, 114, s)-Nets in Base 4
(91, 114, 1062)-Net over F4 — Constructive and digital
Digital (91, 114, 1062)-net over F4, using
- (u, u+v)-construction [i] based on
- digital (11, 22, 34)-net over F4, using
- trace code for nets [i] based on digital (0, 11, 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, 11, 17)-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 (11, 22, 34)-net over F4, using
(91, 114, 4356)-Net over F4 — Digital
Digital (91, 114, 4356)-net over F4, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(4114, 4356, F4, 23) (dual of [4356, 4242, 24]-code), using
- 243 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) [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
- 243 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) [i] based on linear OA(4103, 4102, F4, 23) (dual of [4102, 3999, 24]-code), using
(91, 114, 2504318)-Net in Base 4 — Upper bound on s
There is no (91, 114, 2504319)-net in base 4, because
- 1 times m-reduction [i] would yield (91, 113, 2504319)-net in base 4, but
- the generalized Rao bound for nets shows that 4m ≥ 107 840216 106102 177157 803308 418085 143963 233979 489842 134735 016389 291360 > 4113 [i]