Best Known (83−20, 83, s)-Nets in Base 4
(83−20, 83, 1028)-Net over F4 — Constructive and digital
Digital (63, 83, 1028)-net over F4, using
- 1 times m-reduction [i] based on digital (63, 84, 1028)-net over F4, using
- trace code for nets [i] based on digital (0, 21, 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, 21, 257)-net over F256, using
(83−20, 83, 1163)-Net over F4 — Digital
Digital (63, 83, 1163)-net over F4, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(483, 1163, F4, 20) (dual of [1163, 1080, 21]-code), using
- 123 step Varšamov–Edel lengthening with (ri) = (2, 0, 1, 4 times 0, 1, 9 times 0, 1, 19 times 0, 1, 33 times 0, 1, 51 times 0) [i] based on linear OA(476, 1033, F4, 20) (dual of [1033, 957, 21]-code), using
- construction XX applied to C1 = C([1022,17]), C2 = C([0,18]), C3 = C1 + C2 = C([0,17]), and C∩ = C1 ∩ C2 = C([1022,18]) [i] based on
- linear OA(471, 1023, F4, 19) (dual of [1023, 952, 20]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {−1,0,…,17}, and designed minimum distance d ≥ |I|+1 = 20 [i]
- linear OA(471, 1023, F4, 19) (dual of [1023, 952, 20]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [0,18], and designed minimum distance d ≥ |I|+1 = 20 [i]
- linear OA(476, 1023, F4, 20) (dual of [1023, 947, 21]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {−1,0,…,18}, and designed minimum distance d ≥ |I|+1 = 21 [i]
- linear OA(466, 1023, F4, 18) (dual of [1023, 957, 19]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [0,17], and designed minimum distance d ≥ |I|+1 = 19 [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,17]), C2 = C([0,18]), C3 = C1 + C2 = C([0,17]), and C∩ = C1 ∩ C2 = C([1022,18]) [i] based on
- 123 step Varšamov–Edel lengthening with (ri) = (2, 0, 1, 4 times 0, 1, 9 times 0, 1, 19 times 0, 1, 33 times 0, 1, 51 times 0) [i] based on linear OA(476, 1033, F4, 20) (dual of [1033, 957, 21]-code), using
(83−20, 83, 149944)-Net in Base 4 — Upper bound on s
There is no (63, 83, 149945)-net in base 4, because
- the generalized Rao bound for nets shows that 4m ≥ 93 539764 160161 192310 860538 572687 802048 698996 323400 > 483 [i]