Best Known (90, 90+31, s)-Nets in Base 4
(90, 90+31, 531)-Net over F4 — Constructive and digital
Digital (90, 121, 531)-net over F4, using
- t-expansion [i] based on digital (89, 121, 531)-net over F4, using
- 2 times m-reduction [i] based on digital (89, 123, 531)-net over F4, using
- trace code for nets [i] based on digital (7, 41, 177)-net over F64, using
- net from sequence [i] based on digital (7, 176)-sequence over F64, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F64 with g(F) = 7 and N(F) ≥ 177, using
- net from sequence [i] based on digital (7, 176)-sequence over F64, using
- trace code for nets [i] based on digital (7, 41, 177)-net over F64, using
- 2 times m-reduction [i] based on digital (89, 123, 531)-net over F4, using
(90, 90+31, 576)-Net in Base 4 — Constructive
(90, 121, 576)-net in base 4, using
- 41 times duplication [i] based on (89, 120, 576)-net in base 4, using
- trace code for nets [i] based on (9, 40, 192)-net in base 64, using
- 2 times m-reduction [i] based on (9, 42, 192)-net in base 64, using
- base change [i] based on digital (3, 36, 192)-net over F128, using
- net from sequence [i] based on digital (3, 191)-sequence over F128, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F128 with g(F) = 3 and N(F) ≥ 192, using
- net from sequence [i] based on digital (3, 191)-sequence over F128, using
- base change [i] based on digital (3, 36, 192)-net over F128, using
- 2 times m-reduction [i] based on (9, 42, 192)-net in base 64, using
- trace code for nets [i] based on (9, 40, 192)-net in base 64, using
(90, 90+31, 1103)-Net over F4 — Digital
Digital (90, 121, 1103)-net over F4, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(4121, 1103, F4, 31) (dual of [1103, 982, 32]-code), using
- 65 step Varšamov–Edel lengthening with (ri) = (2, 0, 0, 1, 8 times 0, 1, 19 times 0, 1, 32 times 0) [i] based on linear OA(4116, 1033, F4, 31) (dual of [1033, 917, 32]-code), using
- construction XX applied to C1 = C([1022,28]), C2 = C([0,29]), C3 = C1 + C2 = C([0,28]), and C∩ = C1 ∩ C2 = C([1022,29]) [i] based on
- linear OA(4111, 1023, F4, 30) (dual of [1023, 912, 31]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {−1,0,…,28}, and designed minimum distance d ≥ |I|+1 = 31 [i]
- linear OA(4111, 1023, F4, 30) (dual of [1023, 912, 31]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [0,29], and designed minimum distance d ≥ |I|+1 = 31 [i]
- linear OA(4116, 1023, F4, 31) (dual of [1023, 907, 32]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {−1,0,…,29}, and designed minimum distance d ≥ |I|+1 = 32 [i]
- linear OA(4106, 1023, F4, 29) (dual of [1023, 917, 30]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [0,28], and designed minimum distance d ≥ |I|+1 = 30 [i]
- linear OA(40, 5, F4, 0) (dual of [5, 5, 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
- linear OA(40, 5, F4, 0) (dual of [5, 5, 1]-code) (see above)
- construction XX applied to C1 = C([1022,28]), C2 = C([0,29]), C3 = C1 + C2 = C([0,28]), and C∩ = C1 ∩ C2 = C([1022,29]) [i] based on
- 65 step Varšamov–Edel lengthening with (ri) = (2, 0, 0, 1, 8 times 0, 1, 19 times 0, 1, 32 times 0) [i] based on linear OA(4116, 1033, F4, 31) (dual of [1033, 917, 32]-code), using
(90, 90+31, 140309)-Net in Base 4 — Upper bound on s
There is no (90, 121, 140310)-net in base 4, because
- 1 times m-reduction [i] would yield (90, 120, 140310)-net in base 4, but
- the generalized Rao bound for nets shows that 4m ≥ 1 766874 413550 910465 332970 450890 849187 466220 280636 047005 594441 364113 970088 > 4120 [i]