Best Known (106−33, 106, s)-Nets in Base 5
(106−33, 106, 296)-Net over F5 — Constructive and digital
Digital (73, 106, 296)-net over F5, using
- 2 times m-reduction [i] based on digital (73, 108, 296)-net over F5, using
- trace code for nets [i] based on digital (19, 54, 148)-net over F25, using
- net from sequence [i] based on digital (19, 147)-sequence over F25, using
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F25 with g(F) = 19 and N(F) ≥ 148, using
- net from sequence [i] based on digital (19, 147)-sequence over F25, using
- trace code for nets [i] based on digital (19, 54, 148)-net over F25, using
(106−33, 106, 679)-Net over F5 — Digital
Digital (73, 106, 679)-net over F5, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(5106, 679, F5, 33) (dual of [679, 573, 34]-code), using
- 44 step Varšamov–Edel lengthening with (ri) = (1, 0, 0, 0, 1, 13 times 0, 1, 25 times 0) [i] based on linear OA(5103, 632, F5, 33) (dual of [632, 529, 34]-code), using
- construction XX applied to C1 = C([623,30]), C2 = C([0,31]), C3 = C1 + C2 = C([0,30]), and C∩ = C1 ∩ C2 = C([623,31]) [i] based on
- linear OA(599, 624, F5, 32) (dual of [624, 525, 33]-code), using the primitive BCH-code C(I) with length 624 = 54−1, defining interval I = {−1,0,…,30}, and designed minimum distance d ≥ |I|+1 = 33 [i]
- linear OA(599, 624, F5, 32) (dual of [624, 525, 33]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 54−1, defining interval I = [0,31], and designed minimum distance d ≥ |I|+1 = 33 [i]
- linear OA(5103, 624, F5, 33) (dual of [624, 521, 34]-code), using the primitive BCH-code C(I) with length 624 = 54−1, defining interval I = {−1,0,…,31}, and designed minimum distance d ≥ |I|+1 = 34 [i]
- linear OA(595, 624, F5, 31) (dual of [624, 529, 32]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 54−1, defining interval I = [0,30], and designed minimum distance d ≥ |I|+1 = 32 [i]
- linear OA(50, 4, F5, 0) (dual of [4, 4, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(50, s, F5, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- linear OA(50, 4, F5, 0) (dual of [4, 4, 1]-code) (see above)
- construction XX applied to C1 = C([623,30]), C2 = C([0,31]), C3 = C1 + C2 = C([0,30]), and C∩ = C1 ∩ C2 = C([623,31]) [i] based on
- 44 step Varšamov–Edel lengthening with (ri) = (1, 0, 0, 0, 1, 13 times 0, 1, 25 times 0) [i] based on linear OA(5103, 632, F5, 33) (dual of [632, 529, 34]-code), using
(106−33, 106, 65673)-Net in Base 5 — Upper bound on s
There is no (73, 106, 65674)-net in base 5, because
- 1 times m-reduction [i] would yield (73, 105, 65674)-net in base 5, but
- the generalized Rao bound for nets shows that 5m ≥ 24 652010 948418 566212 810502 495115 444470 262830 565885 605564 056479 993334 735617 > 5105 [i]