Best Known (24−9, 24, s)-Nets in Base 16
(24−9, 24, 634)-Net over F16 — Constructive and digital
Digital (15, 24, 634)-net over F16, using
- (u, u+v)-construction [i] based on
- digital (2, 6, 120)-net over F16, using
- net defined by OOA [i] based on linear OOA(166, 120, F16, 4, 4) (dual of [(120, 4), 474, 5]-NRT-code), using
- OA 2-folding and stacking [i] based on linear OA(166, 240, F16, 4) (dual of [240, 234, 5]-code), using
- 1 times truncation [i] based on linear OA(167, 241, F16, 5) (dual of [241, 234, 6]-code), using
- OA 2-folding and stacking [i] based on linear OA(166, 240, F16, 4) (dual of [240, 234, 5]-code), using
- net defined by OOA [i] based on linear OOA(166, 120, F16, 4, 4) (dual of [(120, 4), 474, 5]-NRT-code), using
- digital (9, 18, 514)-net over F16, using
- trace code for nets [i] based on digital (0, 9, 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, 9, 257)-net over F256, using
- digital (2, 6, 120)-net over F16, using
(24−9, 24, 1036)-Net over F16 — Digital
Digital (15, 24, 1036)-net over F16, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(1624, 1036, F16, 9) (dual of [1036, 1012, 10]-code), using
- 516 step Varšamov–Edel lengthening with (ri) = (2, 0, 0, 0, 1, 16 times 0, 1, 58 times 0, 1, 154 times 0, 1, 280 times 0) [i] based on linear OA(1618, 514, F16, 9) (dual of [514, 496, 10]-code), using
- trace code [i] based on linear OA(2569, 257, F256, 9) (dual of [257, 248, 10]-code or 257-arc in PG(8,256)), using
- extended Reed–Solomon code RSe(248,256) [i]
- the expurgated narrow-sense BCH-code C(I) with length 257 | 2562−1, defining interval I = [0,4], and minimum distance d ≥ |{−4,−3,…,4}|+1 = 10 (BCH-bound) [i]
- algebraic-geometric code AG(F, Q+122P) with degQ = 3 and degPÂ =Â 2 [i] based on function field F/F256 with g(F) = 0 and N(F) ≥ 257, using the rational function field F256(x) [i]
- algebraic-geometric code AG(F, Q+81P) with degQ = 4 and degPÂ =Â 3 [i] based on function field F/F256 with g(F) = 0 and N(F) ≥ 257 (see above)
- algebraic-geometric code AG(F, Q+49P) with degQ = 2 and degPÂ =Â 5 [i] based on function field F/F256 with g(F) = 0 and N(F) ≥ 257 (see above)
- trace code [i] based on linear OA(2569, 257, F256, 9) (dual of [257, 248, 10]-code or 257-arc in PG(8,256)), using
- 516 step Varšamov–Edel lengthening with (ri) = (2, 0, 0, 0, 1, 16 times 0, 1, 58 times 0, 1, 154 times 0, 1, 280 times 0) [i] based on linear OA(1618, 514, F16, 9) (dual of [514, 496, 10]-code), using
(24−9, 24, 1237801)-Net in Base 16 — Upper bound on s
There is no (15, 24, 1237802)-net in base 16, because
- 1 times m-reduction [i] would yield (15, 23, 1237802)-net in base 16, but
- the generalized Rao bound for nets shows that 16m ≥ 4951 776041 460903 940097 673046 > 1623 [i]