Information on Result #2301025
Linear OA(3185, 218, F3, 89) (dual of [218, 33, 90]-code), using 2 times truncation based on linear OA(3187, 220, F3, 91) (dual of [220, 33, 92]-code), using
- construction X with Varšamov bound [i] based on
- linear OA(3181, 213, F3, 91) (dual of [213, 32, 92]-code), using
- 31 times truncation [i] based on linear OA(3212, 244, F3, 122) (dual of [244, 32, 123]-code), using
- construction X applied to Ce(121) ⊂ Ce(120) [i] based on
- linear OA(3212, 243, F3, 122) (dual of [243, 31, 123]-code), using an extension Ce(121) of the primitive narrow-sense BCH-code C(I) with length 242 = 35−1, defining interval I = [1,121], and designed minimum distance d ≥ |I|+1 = 122 [i]
- linear OA(3211, 243, F3, 121) (dual of [243, 32, 122]-code), using an extension Ce(120) of the primitive narrow-sense BCH-code C(I) with length 242 = 35−1, defining interval I = [1,120], and designed minimum distance d ≥ |I|+1 = 121 [i]
- linear OA(30, 1, F3, 0) (dual of [1, 1, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(30, s, F3, 0) (dual of [s, s, 1]-code) for arbitrarily large s, using
- construction X applied to Ce(121) ⊂ Ce(120) [i] based on
- 31 times truncation [i] based on linear OA(3212, 244, F3, 122) (dual of [244, 32, 123]-code), using
- linear OA(3181, 214, F3, 85) (dual of [214, 33, 86]-code), using Gilbert–Varšamov bound and bm = 3181 > Vbs−1(k−1) = 174 008132 274775 633679 311132 226037 579802 499509 180900 015176 809274 235439 835616 318219 208627 [i]
- linear OA(35, 6, F3, 5) (dual of [6, 1, 6]-code or 6-arc in PG(4,3)), using
- dual of repetition code with length 6 [i]
- linear OA(3181, 213, F3, 91) (dual of [213, 32, 92]-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.