Information on Result #1297235
Linear OA(2116, 202, F2, 32) (dual of [202, 86, 33]-code), using construction X with Varšamov bound based on
- linear OA(2112, 197, F2, 32) (dual of [197, 85, 33]-code), using
- 1 times truncation [i] based on linear OA(2113, 198, F2, 33) (dual of [198, 85, 34]-code), using
- concatenation of two codes [i] based on
- linear OA(3216, 33, F32, 16) (dual of [33, 17, 17]-code or 33-arc in PG(15,32)), using
- extended Reed–Solomon code RSe(17,32) [i]
- linear OA(21, 6, F2, 1) (dual of [6, 5, 2]-code), using
- discarding factors / shortening the dual code based on linear OA(21, s, F2, 1) (dual of [s, s−1, 2]-code) for arbitrarily large s, using
- linear OA(3216, 33, F32, 16) (dual of [33, 17, 17]-code or 33-arc in PG(15,32)), using
- concatenation of two codes [i] based on
- 1 times truncation [i] based on linear OA(2113, 198, F2, 33) (dual of [198, 85, 34]-code), using
- linear OA(2112, 198, F2, 28) (dual of [198, 86, 29]-code), using Gilbert–Varšamov bound and bm = 2112 > Vbs−1(k−1) = 1501 661129 447732 708293 304580 646352 [i]
- linear OA(23, 4, F2, 3) (dual of [4, 1, 4]-code or 4-arc in PG(2,2) or 4-cap in PG(2,2)), using
- dual of repetition code with length 4 [i]
- caps in base b = 2 [i]
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.