Information on Result #701055

Linear OA(452, 78, F4, 27) (dual of [78, 26, 28]-code), using construction XX applied to C1 = C({0,1,2,3,5,6,7,9,10,11,13,14,15,31,47}), C2 = C([0,22]), C3 = C1 + C2 = C([0,15]), and C∩ = C1 ∩ C2 = C({0,1,2,3,5,6,7,9,10,11,13,14,15,21,22,31,47}) based on
  1. linear OA(443, 63, F4, 25) (dual of [63, 20, 26]-code), using the primitive cyclic code C(A) with length 63 = 43−1, defining set A = {0,1,2,3,5,6,7,9,10,11,13,14,15,31,47}, and minimum distance d ≥ |{−4,−3,…,20}|+1 = 26 (BCH-bound) [i]
  2. linear OA(441, 63, F4, 23) (dual of [63, 22, 24]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 63 = 43−1, defining interval I = [0,22], and designed minimum distance d ≥ |I|+1 = 24 [i]
  3. linear OA(447, 63, F4, 27) (dual of [63, 16, 28]-code), using the primitive cyclic code C(A) with length 63 = 43−1, defining set A = {0,1,2,3,5,6,7,9,10,11,13,14,15,21,22,31,47}, and minimum distance d ≥ |{−4,−3,…,22}|+1 = 28 (BCH-bound) [i]
  4. linear OA(437, 63, F4, 21) (dual of [63, 26, 22]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 63 = 43−1, defining interval I = [0,15], and designed minimum distance d ≥ |I|+1 = 22 [i]
  5. linear OA(44, 10, F4, 3) (dual of [10, 6, 4]-code or 10-cap in PG(3,4)), using
  6. linear OA(41, 5, F4, 1) (dual of [5, 4, 2]-code), 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.

Compare with Markus Grassl’s online database of code parameters.

Other Results with Identical Parameters

None.

Depending Results

The following results depend on this result:

ResultThis
result
only		Method
1Linear OOA(452, 39, F4, 2, 27) (dual of [(39, 2), 26, 28]-NRT-code) [i]OOA Folding
2Linear OOA(452, 26, F4, 3, 27) (dual of [(26, 3), 26, 28]-NRT-code) [i]