Best Known (8, 15, s)-Nets in Base 25
(8, 15, 211)-Net over F25 — Constructive and digital
Digital (8, 15, 211)-net over F25, using
- net defined by OOA [i] based on linear OOA(2515, 211, F25, 7, 7) (dual of [(211, 7), 1462, 8]-NRT-code), using
- OOA 3-folding and stacking with additional row [i] based on linear OA(2515, 634, F25, 7) (dual of [634, 619, 8]-code), using
- construction XX applied to C1 = C([621,2]), C2 = C([0,3]), C3 = C1 + C2 = C([0,2]), and C∩ = C1 ∩ C2 = C([621,3]) [i] based on
- linear OA(2511, 624, F25, 6) (dual of [624, 613, 7]-code), using the primitive BCH-code C(I) with length 624 = 252−1, defining interval I = {−3,−2,…,2}, and designed minimum distance d ≥ |I|+1 = 7 [i]
- linear OA(257, 624, F25, 4) (dual of [624, 617, 5]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 252−1, defining interval I = [0,3], and designed minimum distance d ≥ |I|+1 = 5 [i]
- linear OA(2513, 624, F25, 7) (dual of [624, 611, 8]-code), using the primitive BCH-code C(I) with length 624 = 252−1, defining interval I = {−3,−2,…,3}, and designed minimum distance d ≥ |I|+1 = 8 [i]
- linear OA(255, 624, F25, 3) (dual of [624, 619, 4]-code or 624-cap in PG(4,25)), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 252−1, defining interval I = [0,2], and designed minimum distance d ≥ |I|+1 = 4 [i]
- linear OA(252, 8, F25, 2) (dual of [8, 6, 3]-code or 8-arc in PG(1,25)), using
- discarding factors / shortening the dual code based on linear OA(252, 25, F25, 2) (dual of [25, 23, 3]-code or 25-arc in PG(1,25)), using
- Reed–Solomon code RS(23,25) [i]
- discarding factors / shortening the dual code based on linear OA(252, 25, F25, 2) (dual of [25, 23, 3]-code or 25-arc in PG(1,25)), using
- linear OA(250, 2, F25, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(250, s, F25, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- construction XX applied to C1 = C([621,2]), C2 = C([0,3]), C3 = C1 + C2 = C([0,2]), and C∩ = C1 ∩ C2 = C([621,3]) [i] based on
- OOA 3-folding and stacking with additional row [i] based on linear OA(2515, 634, F25, 7) (dual of [634, 619, 8]-code), using
(8, 15, 648)-Net over F25 — Digital
Digital (8, 15, 648)-net over F25, using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(2515, 648, F25, 7) (dual of [648, 633, 8]-code), using
- 18 step Varšamov–Edel lengthening with (ri) = (2, 17 times 0) [i] based on linear OA(2513, 628, F25, 7) (dual of [628, 615, 8]-code), using
- construction XX applied to C1 = C([623,4]), C2 = C([0,5]), C3 = C1 + C2 = C([0,4]), and C∩ = C1 ∩ C2 = C([623,5]) [i] based on
- linear OA(2511, 624, F25, 6) (dual of [624, 613, 7]-code), using the primitive BCH-code C(I) with length 624 = 252−1, defining interval I = {−1,0,…,4}, and designed minimum distance d ≥ |I|+1 = 7 [i]
- linear OA(2511, 624, F25, 6) (dual of [624, 613, 7]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 252−1, defining interval I = [0,5], and designed minimum distance d ≥ |I|+1 = 7 [i]
- linear OA(2513, 624, F25, 7) (dual of [624, 611, 8]-code), using the primitive BCH-code C(I) with length 624 = 252−1, defining interval I = {−1,0,…,5}, and designed minimum distance d ≥ |I|+1 = 8 [i]
- linear OA(259, 624, F25, 5) (dual of [624, 615, 6]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 624 = 252−1, defining interval I = [0,4], and designed minimum distance d ≥ |I|+1 = 6 [i]
- linear OA(250, 2, F25, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(250, s, F25, 0) (dual of [s, s, 1]-code) with arbitrarily large s, using
- linear OA(250, 2, F25, 0) (dual of [2, 2, 1]-code) (see above)
- construction XX applied to C1 = C([623,4]), C2 = C([0,5]), C3 = C1 + C2 = C([0,4]), and C∩ = C1 ∩ C2 = C([623,5]) [i] based on
- 18 step Varšamov–Edel lengthening with (ri) = (2, 17 times 0) [i] based on linear OA(2513, 628, F25, 7) (dual of [628, 615, 8]-code), using
(8, 15, 252866)-Net in Base 25 — Upper bound on s
There is no (8, 15, 252867)-net in base 25, because
- 1 times m-reduction [i] would yield (8, 14, 252867)-net in base 25, but
- the generalized Rao bound for nets shows that 25m ≥ 37 253299 130520 824665 > 2514 [i]