Information on Result #1299870

Linear OA(463, 80, F4, 34) (dual of [80, 17, 35]-code), using construction X with VarÅ¡amov bound based on
  1. linear OA(462, 78, F4, 34) (dual of [78, 16, 35]-code), using
    • construction XX applied to C1 = C({0,1,2,3,5,6,7,9,10,11,13,14,15,21,22,23,26,31,47}), C2 = C([0,27]), C3 = C1 + C2 = C([0,26]), and C∩ = C1 ∩ C2 = C({0,1,2,3,5,6,7,9,10,11,13,14,15,21,22,23,26,27,31,47}) [i] based on
      1. linear OA(453, 63, F4, 31) (dual of [63, 10, 32]-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,23,26,31,47}, and minimum distance d ≥ |{−4,−3,…,26}|+1 = 32 (BCH-bound) [i]
      2. linear OA(450, 63, F4, 30) (dual of [63, 13, 31]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 63 = 43−1, defining interval I = [0,27], and designed minimum distance d ≥ |I|+1 = 31 [i]
      3. linear OA(456, 63, F4, 34) (dual of [63, 7, 35]-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,23,26,27,31,47}, and minimum distance d ≥ |{−4,−3,…,29}|+1 = 35 (BCH-bound) [i]
      4. linear OA(447, 63, F4, 27) (dual of [63, 16, 28]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 63 = 43−1, defining interval I = [0,26], and designed minimum distance d ≥ |I|+1 = 28 [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(42, 5, F4, 2) (dual of [5, 3, 3]-code or 5-arc in PG(1,4)), using
  2. linear OA(462, 79, F4, 33) (dual of [79, 17, 34]-code), using Gilbert–VarÅ¡amov bound and bm = 462 > Vbs−1(k−1) = 18 668512 125057 448287 702735 693003 355870 [i]
  3. linear OA(40, 1, F4, 0) (dual of [1, 1, 1]-code), using

Mode: 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

None.