Best Known (116, 116+30, s)-Nets in Base 4
(116, 116+30, 1055)-Net over F4 — Constructive and digital
Digital (116, 146, 1055)-net over F4, using
- 41 times duplication [i] based on digital (115, 145, 1055)-net over F4, using
- (u, u+v)-construction [i] based on
- digital (10, 25, 27)-net over F4, using
- net from sequence [i] based on digital (10, 26)-sequence over F4, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F4 with g(F) = 10 and N(F) ≥ 27, using
- net from sequence [i] based on digital (10, 26)-sequence over F4, using
- digital (90, 120, 1028)-net over F4, using
- trace code for nets [i] based on digital (0, 30, 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, 30, 257)-net over F256, using
- digital (10, 25, 27)-net over F4, using
- (u, u+v)-construction [i] based on
(116, 116+30, 4381)-Net over F4 — Digital
Digital (116, 146, 4381)-net over F4, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(4146, 4381, F4, 30) (dual of [4381, 4235, 31]-code), using
- 266 step Varšamov–Edel lengthening with (ri) = (3, 1, 1, 0, 1, 0, 0, 0, 1, 5 times 0, 1, 10 times 0, 1, 16 times 0, 1, 26 times 0, 1, 41 times 0, 1, 62 times 0, 1, 91 times 0) [i] based on linear OA(4133, 4102, F4, 30) (dual of [4102, 3969, 31]-code), using
- construction X applied to Ce(29) ⊂ Ce(28) [i] based on
- linear OA(4133, 4096, F4, 30) (dual of [4096, 3963, 31]-code), using an extension Ce(29) of the primitive narrow-sense BCH-code C(I) with length 4095 = 46−1, defining interval I = [1,29], and designed minimum distance d ≥ |I|+1 = 30 [i]
- linear OA(4127, 4096, F4, 29) (dual of [4096, 3969, 30]-code), using an extension Ce(28) of the primitive narrow-sense BCH-code C(I) with length 4095 = 46−1, defining interval I = [1,28], and designed minimum distance d ≥ |I|+1 = 29 [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(29) ⊂ Ce(28) [i] based on
- 266 step Varšamov–Edel lengthening with (ri) = (3, 1, 1, 0, 1, 0, 0, 0, 1, 5 times 0, 1, 10 times 0, 1, 16 times 0, 1, 26 times 0, 1, 41 times 0, 1, 62 times 0, 1, 91 times 0) [i] based on linear OA(4133, 4102, F4, 30) (dual of [4102, 3969, 31]-code), using
(116, 116+30, 1551288)-Net in Base 4 — Upper bound on s
There is no (116, 146, 1551289)-net in base 4, because
- the generalized Rao bound for nets shows that 4m ≥ 7957 200407 901031 581082 146463 037567 021053 917624 326398 799570 545211 368321 013785 706193 380560 > 4146 [i]