Best Known (86, 86+30, s)-Nets in Base 4
(86, 86+30, 531)-Net over F4 — Constructive and digital
Digital (86, 116, 531)-net over F4, using
- t-expansion [i] based on digital (85, 116, 531)-net over F4, using
- 1 times m-reduction [i] based on digital (85, 117, 531)-net over F4, using
- trace code for nets [i] based on digital (7, 39, 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, 39, 177)-net over F64, using
- 1 times m-reduction [i] based on digital (85, 117, 531)-net over F4, using
(86, 86+30, 1062)-Net over F4 — Digital
Digital (86, 116, 1062)-net over F4, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(4116, 1062, F4, 30) (dual of [1062, 946, 31]-code), using
- 24 step Varšamov–Edel lengthening with (ri) = (2, 0, 0, 1, 6 times 0, 1, 13 times 0) [i] based on linear OA(4112, 1034, F4, 30) (dual of [1034, 922, 31]-code), using
- construction XX applied to C1 = C([313,341]), C2 = C([315,342]), C3 = C1 + C2 = C([315,341]), and C∩ = C1 ∩ C2 = C([313,342]) [i] based on
- linear OA(4106, 1023, F4, 29) (dual of [1023, 917, 30]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {313,314,…,341}, and designed minimum distance d ≥ |I|+1 = 30 [i]
- linear OA(4106, 1023, F4, 28) (dual of [1023, 917, 29]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {315,316,…,342}, and designed minimum distance d ≥ |I|+1 = 29 [i]
- 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 = {313,314,…,342}, and designed minimum distance d ≥ |I|+1 = 31 [i]
- linear OA(4101, 1023, F4, 27) (dual of [1023, 922, 28]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {315,316,…,341}, and designed minimum distance d ≥ |I|+1 = 28 [i]
- linear OA(41, 6, F4, 1) (dual of [6, 5, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(41, s, F4, 1) (dual of [s, s−1, 2]-code) with arbitrarily large s, using
- 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
- construction XX applied to C1 = C([313,341]), C2 = C([315,342]), C3 = C1 + C2 = C([315,341]), and C∩ = C1 ∩ C2 = C([313,342]) [i] based on
- 24 step Varšamov–Edel lengthening with (ri) = (2, 0, 0, 1, 6 times 0, 1, 13 times 0) [i] based on linear OA(4112, 1034, F4, 30) (dual of [1034, 922, 31]-code), using
(86, 86+30, 96944)-Net in Base 4 — Upper bound on s
There is no (86, 116, 96945)-net in base 4, because
- the generalized Rao bound for nets shows that 4m ≥ 6902 504685 941271 708386 552205 213985 890512 441326 860849 878089 633365 518512 > 4116 [i]