Information on Result #728628
Linear OA(3283, 1051, F32, 39) (dual of [1051, 968, 40]-code), using construction XX applied to C1 = C([1019,33]), C2 = C([6,34]), C3 = C1 + C2 = C([6,33]), and C∩ = C1 ∩ C2 = C([1019,34]) based on
- linear OA(3272, 1023, F32, 38) (dual of [1023, 951, 39]-code), using the primitive BCH-code C(I) with length 1023 = 322−1, defining interval I = {−4,−3,…,33}, and designed minimum distance d ≥ |I|+1 = 39 [i]
- linear OA(3257, 1023, F32, 29) (dual of [1023, 966, 30]-code), using the primitive BCH-code C(I) with length 1023 = 322−1, defining interval I = {6,7,…,34}, and designed minimum distance d ≥ |I|+1 = 30 [i]
- linear OA(3274, 1023, F32, 39) (dual of [1023, 949, 40]-code), using the primitive BCH-code C(I) with length 1023 = 322−1, defining interval I = {−4,−3,…,34}, and designed minimum distance d ≥ |I|+1 = 40 [i]
- linear OA(3255, 1023, F32, 28) (dual of [1023, 968, 29]-code), using the primitive BCH-code C(I) with length 1023 = 322−1, defining interval I = {6,7,…,33}, and designed minimum distance d ≥ |I|+1 = 29 [i]
- linear OA(329, 26, F32, 9) (dual of [26, 17, 10]-code or 26-arc in PG(8,32)), using
- discarding factors / shortening the dual code based on linear OA(329, 32, F32, 9) (dual of [32, 23, 10]-code or 32-arc in PG(8,32)), using
- Reed–Solomon code RS(23,32) [i]
- discarding factors / shortening the dual code based on linear OA(329, 32, F32, 9) (dual of [32, 23, 10]-code or 32-arc in PG(8,32)), using
- linear OA(320, 2, F32, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(320, s, F32, 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
The following results depend on this result:
| Result | This result only | Method | ||
|---|---|---|---|---|
| 1 | OA(16104, 1051, S16, 39) | [i] | Discarding Parts of the Base for OAs | |