Best Known (91, 117, s)-Nets in Base 3
(91, 117, 464)-Net over F3 — Constructive and digital
Digital (91, 117, 464)-net over F3, using
- 31 times duplication [i] based on digital (90, 116, 464)-net over F3, using
- t-expansion [i] based on digital (89, 116, 464)-net over F3, using
- trace code for nets [i] based on digital (2, 29, 116)-net over F81, using
- net from sequence [i] based on digital (2, 115)-sequence over F81, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F81 with g(F) = 2 and N(F) ≥ 116, using
- net from sequence [i] based on digital (2, 115)-sequence over F81, using
- trace code for nets [i] based on digital (2, 29, 116)-net over F81, using
- t-expansion [i] based on digital (89, 116, 464)-net over F3, using
(91, 117, 889)-Net over F3 — Digital
Digital (91, 117, 889)-net over F3, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(3117, 889, F3, 26) (dual of [889, 772, 27]-code), using
- 135 step Varšamov–Edel lengthening with (ri) = (3, 1, 0, 1, 0, 1, 0, 0, 0, 1, 6 times 0, 1, 8 times 0, 1, 12 times 0, 1, 16 times 0, 1, 21 times 0, 1, 26 times 0, 1, 30 times 0) [i] based on linear OA(3104, 741, F3, 26) (dual of [741, 637, 27]-code), using
- construction XX applied to C1 = C([340,364]), C2 = C([342,365]), C3 = C1 + C2 = C([342,364]), and C∩ = C1 ∩ C2 = C([340,365]) [i] based on
- linear OA(397, 728, F3, 25) (dual of [728, 631, 26]-code), using the primitive BCH-code C(I) with length 728 = 36−1, defining interval I = {340,341,…,364}, and designed minimum distance d ≥ |I|+1 = 26 [i]
- linear OA(397, 728, F3, 24) (dual of [728, 631, 25]-code), using the primitive BCH-code C(I) with length 728 = 36−1, defining interval I = {342,343,…,365}, and designed minimum distance d ≥ |I|+1 = 25 [i]
- linear OA(3103, 728, F3, 26) (dual of [728, 625, 27]-code), using the primitive BCH-code C(I) with length 728 = 36−1, defining interval I = {340,341,…,365}, and designed minimum distance d ≥ |I|+1 = 27 [i]
- linear OA(391, 728, F3, 23) (dual of [728, 637, 24]-code), using the primitive BCH-code C(I) with length 728 = 36−1, defining interval I = {342,343,…,364}, and designed minimum distance d ≥ |I|+1 = 24 [i]
- linear OA(31, 7, F3, 1) (dual of [7, 6, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(31, s, F3, 1) (dual of [s, s−1, 2]-code) with arbitrarily large s, using
- linear OA(30, 6, F3, 0) (dual of [6, 6, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(30, s, F3, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- construction XX applied to C1 = C([340,364]), C2 = C([342,365]), C3 = C1 + C2 = C([342,364]), and C∩ = C1 ∩ C2 = C([340,365]) [i] based on
- 135 step Varšamov–Edel lengthening with (ri) = (3, 1, 0, 1, 0, 1, 0, 0, 0, 1, 6 times 0, 1, 8 times 0, 1, 12 times 0, 1, 16 times 0, 1, 21 times 0, 1, 26 times 0, 1, 30 times 0) [i] based on linear OA(3104, 741, F3, 26) (dual of [741, 637, 27]-code), using
(91, 117, 55766)-Net in Base 3 — Upper bound on s
There is no (91, 117, 55767)-net in base 3, because
- the generalized Rao bound for nets shows that 3m ≥ 66 570149 039528 914751 328661 773851 099671 551356 507215 188567 > 3117 [i]