Information on Result #857594
Linear OOA(1661, 134, F16, 2, 31) (dual of [(134, 2), 207, 32]-NRT-code), using OOA 2-folding based on linear OA(1661, 268, F16, 31) (dual of [268, 207, 32]-code), using
- construction XX applied to C1 = C([251,25]), C2 = C([0,26]), C3 = C1 + C2 = C([0,25]), and C∩ = C1 ∩ C2 = C([251,26]) [i] based on
- linear OA(1656, 255, F16, 30) (dual of [255, 199, 31]-code), using the primitive BCH-code C(I) with length 255 = 162−1, defining interval I = {−4,−3,…,25}, and designed minimum distance d ≥ |I|+1 = 31 [i]
- linear OA(1650, 255, F16, 27) (dual of [255, 205, 28]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 255 = 162−1, defining interval I = [0,26], and designed minimum distance d ≥ |I|+1 = 28 [i]
- linear OA(1658, 255, F16, 31) (dual of [255, 197, 32]-code), using the primitive BCH-code C(I) with length 255 = 162−1, defining interval I = {−4,−3,…,26}, and designed minimum distance d ≥ |I|+1 = 32 [i]
- linear OA(1648, 255, F16, 26) (dual of [255, 207, 27]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 255 = 162−1, defining interval I = [0,25], and designed minimum distance d ≥ |I|+1 = 27 [i]
- linear OA(163, 11, F16, 3) (dual of [11, 8, 4]-code or 11-arc in PG(2,16) or 11-cap in PG(2,16)), using
- discarding factors / shortening the dual code based on linear OA(163, 16, F16, 3) (dual of [16, 13, 4]-code or 16-arc in PG(2,16) or 16-cap in PG(2,16)), using
- Reed–Solomon code RS(13,16) [i]
- discarding factors / shortening the dual code based on linear OA(163, 16, F16, 3) (dual of [16, 13, 4]-code or 16-arc in PG(2,16) or 16-cap in PG(2,16)), using
- linear OA(160, 2, F16, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(160, s, F16, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
Mode: Constructive and linear.
Optimality
Show details for fixed k and m, n and k, k and s, k and t, n and m, m and s, m and t, n and s, n and t.
Other Results with Identical Parameters
None.
Depending Results
None.