Best Known (100, 100+35, s)-Nets in Base 4
(100, 100+35, 531)-Net over F4 — Constructive and digital
Digital (100, 135, 531)-net over F4, using
- t-expansion [i] based on digital (99, 135, 531)-net over F4, using
- 3 times m-reduction [i] based on digital (99, 138, 531)-net over F4, using
- trace code for nets [i] based on digital (7, 46, 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, 46, 177)-net over F64, using
- 3 times m-reduction [i] based on digital (99, 138, 531)-net over F4, using
(100, 100+35, 576)-Net in Base 4 — Constructive
(100, 135, 576)-net in base 4, using
- trace code for nets [i] based on (10, 45, 192)-net in base 64, using
- 4 times m-reduction [i] based on (10, 49, 192)-net in base 64, using
- base change [i] based on digital (3, 42, 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, 42, 192)-net over F128, using
- 4 times m-reduction [i] based on (10, 49, 192)-net in base 64, using
(100, 100+35, 1127)-Net over F4 — Digital
Digital (100, 135, 1127)-net over F4, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(4135, 1127, F4, 35) (dual of [1127, 992, 36]-code), using
- 90 step Varšamov–Edel lengthening with (ri) = (1, 5 times 0, 1, 15 times 0, 1, 28 times 0, 1, 38 times 0) [i] based on linear OA(4131, 1033, F4, 35) (dual of [1033, 902, 36]-code), using
- construction XX applied to C1 = C([1022,32]), C2 = C([0,33]), C3 = C1 + C2 = C([0,32]), and C∩ = C1 ∩ C2 = C([1022,33]) [i] based on
- linear OA(4126, 1023, F4, 34) (dual of [1023, 897, 35]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {−1,0,…,32}, and designed minimum distance d ≥ |I|+1 = 35 [i]
- linear OA(4126, 1023, F4, 34) (dual of [1023, 897, 35]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [0,33], and designed minimum distance d ≥ |I|+1 = 35 [i]
- linear OA(4131, 1023, F4, 35) (dual of [1023, 892, 36]-code), using the primitive BCH-code C(I) with length 1023 = 45−1, defining interval I = {−1,0,…,33}, and designed minimum distance d ≥ |I|+1 = 36 [i]
- linear OA(4121, 1023, F4, 33) (dual of [1023, 902, 34]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 1023 = 45−1, defining interval I = [0,32], and designed minimum distance d ≥ |I|+1 = 34 [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,32]), C2 = C([0,33]), C3 = C1 + C2 = C([0,32]), and C∩ = C1 ∩ C2 = C([1022,33]) [i] based on
- 90 step Varšamov–Edel lengthening with (ri) = (1, 5 times 0, 1, 15 times 0, 1, 28 times 0, 1, 38 times 0) [i] based on linear OA(4131, 1033, F4, 35) (dual of [1033, 902, 36]-code), using
(100, 100+35, 133176)-Net in Base 4 — Upper bound on s
There is no (100, 135, 133177)-net in base 4, because
- 1 times m-reduction [i] would yield (100, 134, 133177)-net in base 4, but
- the generalized Rao bound for nets shows that 4m ≥ 474 293596 499331 828087 649888 882711 730186 612403 709378 934381 226358 989152 868078 308380 > 4134 [i]