Linear OA(3¹⁴³, 1002, F₃, 32) (dual of [1002, 859, 33]-code), using 243 step VarÅ¡amov–Edel lengthening with (r_i) = (3, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 5 times 0, 1, 8 times 0, 1, 10 times 0, 1, 14 times 0, 1, 18 times 0, 1, 22 times 0, 1, 25 times 0, 1, 27 times 0, 1, 29 times 0, 1, 31 times 0, 1, 32 times 0) based on linear OA(3¹²⁵, 741, F₃, 32) (dual of [741, 616, 33]-code), using

• construction XX applied to C₁ = C([334,364]), C₂ = C([336,365]), C₃ = C₁ + C₂ = C([336,364]), and C_∩ = C₁ ∩ C₂ = C([334,365]) [i] based on
  1. linear OA(3¹¹⁸, 728, F₃, 31) (dual of [728, 610, 32]-code), using the primitive BCH-code C(I) with length 728 = 3⁶−1, defining interval I = {334,335,…,364}, and designed minimum distance d ≥ |I|+1 = 32 [i]
  2. linear OA(3¹¹⁸, 728, F₃, 30) (dual of [728, 610, 31]-code), using the primitive BCH-code C(I) with length 728 = 3⁶−1, defining interval I = {336,337,…,365}, and designed minimum distance d ≥ |I|+1 = 31 [i]
  3. linear OA(3¹²⁴, 728, F₃, 32) (dual of [728, 604, 33]-code), using the primitive BCH-code C(I) with length 728 = 3⁶−1, defining interval I = {334,335,…,365}, and designed minimum distance d ≥ |I|+1 = 33 [i]
  4. linear OA(3¹¹², 728, F₃, 29) (dual of [728, 616, 30]-code), using the primitive BCH-code C(I) with length 728 = 3⁶−1, defining interval I = {336,337,…,364}, and designed minimum distance d ≥ |I|+1 = 30 [i]
  5. linear OA(3¹, 7, F₃, 1) (dual of [7, 6, 2]-code), using
     • discarding factors / shortening the dual code based on linear OA(3¹, s, F₃, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s, using
       • parity-check code [i]
  6. linear OA(3⁰, 6, F₃, 0) (dual of [6, 6, 1]-code), using
     • discarding factors / shortening the dual code based on linear OA(3⁰, s, F₃, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
       • OA with only one run / dual of code without redundancy [i]