Information on Result #701417
Linear OA(732, 55, F7, 20) (dual of [55, 23, 21]-code), using construction XX applied to C1 = C({0,1,2,3,4,5,6,8,9,10,11,12,13,16,34,41}), C2 = C([0,17]), C3 = C1 + C2 = C([0,16]), and C∩ = C1 ∩ C2 = C({0,1,2,3,4,5,6,8,9,10,11,12,13,16,17,34,41}) based on
- linear OA(729, 48, F7, 19) (dual of [48, 19, 20]-code), using the primitive cyclic code C(A) with length 48 = 72−1, defining set A = {0,1,2,3,4,5,6,8,9,10,11,12,13,16,34,41}, and minimum distance d ≥ |{−2,−1,…,16}|+1 = 20 (BCH-bound) [i]
- linear OA(727, 48, F7, 18) (dual of [48, 21, 19]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 48 = 72−1, defining interval I = [0,17], and designed minimum distance d ≥ |I|+1 = 19 [i]
- linear OA(731, 48, F7, 20) (dual of [48, 17, 21]-code), using the primitive cyclic code C(A) with length 48 = 72−1, defining set A = {0,1,2,3,4,5,6,8,9,10,11,12,13,16,17,34,41}, and minimum distance d ≥ |{−2,−1,…,17}|+1 = 21 (BCH-bound) [i]
- linear OA(725, 48, F7, 17) (dual of [48, 23, 18]-code), using the primitive expurgated narrow-sense BCH-code C(I) with length 48 = 72−1, defining interval I = [0,16], and designed minimum distance d ≥ |I|+1 = 18 [i]
- linear OA(71, 5, F7, 1) (dual of [5, 4, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(71, 7, F7, 1) (dual of [7, 6, 2]-code), using
- Reed–Solomon code RS(6,7) [i]
- discarding factors / shortening the dual code based on linear OA(71, 7, F7, 1) (dual of [7, 6, 2]-code), using
- linear OA(70, 2, F7, 0) (dual of [2, 2, 1]-code), using
- discarding factors / shortening the dual code based on linear OA(70, s, F7, 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.
Compare with Markus Grassl’s online database of code parameters.
Other Results with Identical Parameters
None.
Depending Results
None.