Best Known (26−9, 26, s)-Nets in Base 9
(26−9, 26, 328)-Net over F9 — Constructive and digital
Digital (17, 26, 328)-net over F9, using
- (u, u+v)-construction [i] based on
- digital (4, 8, 164)-net over F9, using
- trace code for nets [i] based on digital (0, 4, 82)-net over F81, using
- net from sequence [i] based on digital (0, 81)-sequence over F81, using
- generalized Faure sequence [i]
- Niederreiter–Xing sequence construction II/III [i] based on function field F/F81 with g(F) = 0 and N(F) ≥ 82, using
- the rational function field F81(x) [i]
- Niederreiter sequence [i]
- net from sequence [i] based on digital (0, 81)-sequence over F81, using
- trace code for nets [i] based on digital (0, 4, 82)-net over F81, using
- digital (9, 18, 164)-net over F9, using
- trace code for nets [i] based on digital (0, 9, 82)-net over F81, using
- net from sequence [i] based on digital (0, 81)-sequence over F81 (see above)
- trace code for nets [i] based on digital (0, 9, 82)-net over F81, using
- digital (4, 8, 164)-net over F9, using
(26−9, 26, 749)-Net over F9 — Digital
Digital (17, 26, 749)-net over F9, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(926, 749, F9, 9) (dual of [749, 723, 10]-code), using
- 14 step Varšamov–Edel lengthening with (ri) = (1, 13 times 0) [i] based on linear OA(925, 734, F9, 9) (dual of [734, 709, 10]-code), using
- construction XX applied to C1 = C([727,6]), C2 = C([0,7]), C3 = C1 + C2 = C([0,6]), and C∩ = C1 ∩ C2 = C([727,7]) [i] based on
- linear OA(922, 728, F9, 8) (dual of [728, 706, 9]-code), using the primitive BCH-code C(I) with length 728 = 93−1, defining interval I = {−1,0,…,6}, and designed minimum distance d ≥ |I|+1 = 9 [i]
- linear OA(922, 728, F9, 8) (dual of [728, 706, 9]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 728 = 93−1, defining interval I = [0,7], and designed minimum distance d ≥ |I|+1 = 9 [i]
- linear OA(925, 728, F9, 9) (dual of [728, 703, 10]-code), using the primitive BCH-code C(I) with length 728 = 93−1, defining interval I = {−1,0,…,7}, and designed minimum distance d ≥ |I|+1 = 10 [i]
- linear OA(919, 728, F9, 7) (dual of [728, 709, 8]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 728 = 93−1, defining interval I = [0,6], and designed minimum distance d ≥ |I|+1 = 8 [i]
- linear OA(90, 3, F9, 0) (dual of [3, 3, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(90, s, F9, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- linear OA(90, 3, F9, 0) (dual of [3, 3, 1]-code) (see above)
- construction XX applied to C1 = C([727,6]), C2 = C([0,7]), C3 = C1 + C2 = C([0,6]), and C∩ = C1 ∩ C2 = C([727,7]) [i] based on
- 14 step Varšamov–Edel lengthening with (ri) = (1, 13 times 0) [i] based on linear OA(925, 734, F9, 9) (dual of [734, 709, 10]-code), using
(26−9, 26, 254668)-Net in Base 9 — Upper bound on s
There is no (17, 26, 254669)-net in base 9, because
- 1 times m-reduction [i] would yield (17, 25, 254669)-net in base 9, but
- the generalized Rao bound for nets shows that 9m ≥ 717904 508421 685812 169249 > 925 [i]