Best Known (9, 14, s)-Nets in Base 64
(9, 14, 131076)-Net over F64 — Constructive and digital
Digital (9, 14, 131076)-net over F64, using
- net defined by OOA [i] based on linear OOA(6414, 131076, F64, 5, 5) (dual of [(131076, 5), 655366, 6]-NRT-code), using
- OOA 2-folding and stacking with additional row [i] based on linear OA(6414, 262153, F64, 5) (dual of [262153, 262139, 6]-code), using
- construction X4 applied to C([0,2]) ⊂ C([0,1]) [i] based on
- linear OA(6413, 262145, F64, 5) (dual of [262145, 262132, 6]-code), using the expurgated narrow-sense BCH-code C(I) with length 262145 | 646−1, defining interval I = [0,2], and minimum distance d ≥ |{−2,−1,0,1,2}|+1 = 6 (BCH-bound) [i]
- linear OA(647, 262145, F64, 3) (dual of [262145, 262138, 4]-code or 262145-cap in PG(6,64)), using the expurgated narrow-sense BCH-code C(I) with length 262145 | 646−1, defining interval I = [0,1], and minimum distance d ≥ |{−1,0,1}|+1 = 4 (BCH-bound) [i]
- linear OA(647, 8, F64, 7) (dual of [8, 1, 8]-code or 8-arc in PG(6,64)), using
- dual of repetition code with length 8 [i]
- linear OA(641, 8, F64, 1) (dual of [8, 7, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(641, 64, F64, 1) (dual of [64, 63, 2]-code), using
- Reed–Solomon code RS(63,64) [i]
- discarding factors / shortening the dual code based on linear OA(641, 64, F64, 1) (dual of [64, 63, 2]-code), using
- construction X4 applied to C([0,2]) ⊂ C([0,1]) [i] based on
- OOA 2-folding and stacking with additional row [i] based on linear OA(6414, 262153, F64, 5) (dual of [262153, 262139, 6]-code), using
(9, 14, 262153)-Net over F64 — Digital
Digital (9, 14, 262153)-net over F64, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(6414, 262153, F64, 5) (dual of [262153, 262139, 6]-code), using
- construction X4 applied to C([0,2]) ⊂ C([0,1]) [i] based on
- linear OA(6413, 262145, F64, 5) (dual of [262145, 262132, 6]-code), using the expurgated narrow-sense BCH-code C(I) with length 262145 | 646−1, defining interval I = [0,2], and minimum distance d ≥ |{−2,−1,0,1,2}|+1 = 6 (BCH-bound) [i]
- linear OA(647, 262145, F64, 3) (dual of [262145, 262138, 4]-code or 262145-cap in PG(6,64)), using the expurgated narrow-sense BCH-code C(I) with length 262145 | 646−1, defining interval I = [0,1], and minimum distance d ≥ |{−1,0,1}|+1 = 4 (BCH-bound) [i]
- linear OA(647, 8, F64, 7) (dual of [8, 1, 8]-code or 8-arc in PG(6,64)), using
- dual of repetition code with length 8 [i]
- linear OA(641, 8, F64, 1) (dual of [8, 7, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(641, 64, F64, 1) (dual of [64, 63, 2]-code), using
- Reed–Solomon code RS(63,64) [i]
- discarding factors / shortening the dual code based on linear OA(641, 64, F64, 1) (dual of [64, 63, 2]-code), using
- construction X4 applied to C([0,2]) ⊂ C([0,1]) [i] based on
(9, 14, large)-Net in Base 64 — Upper bound on s
There is no (9, 14, large)-net in base 64, because
- 3 times m-reduction [i] would yield (9, 11, large)-net in base 64, but