Information on Result #1583037
Linear OOA(8142, 1793, F81, 4, 19) (dual of [(1793, 4), 7130, 20]-NRT-code), using OOA 2-folding based on linear OOA(8142, 3586, F81, 2, 19) (dual of [(3586, 2), 7130, 20]-NRT-code), using
- discarding factors / shortening the dual code based on linear OOA(8142, 3587, F81, 2, 19) (dual of [(3587, 2), 7132, 20]-NRT-code), using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(8142, 3587, F81, 19) (dual of [3587, 3545, 20]-code), using
- discarding factors / shortening the dual code based on linear OA(8142, 6579, F81, 19) (dual of [6579, 6537, 20]-code), using
- construction X applied to C([0,9]) ⊂ C([0,6]) [i] based on
- linear OA(8137, 6562, F81, 19) (dual of [6562, 6525, 20]-code), using the expurgated narrow-sense BCH-code C(I) with length 6562 | 814−1, defining interval I = [0,9], and minimum distance d ≥ |{−9,−8,…,9}|+1 = 20 (BCH-bound) [i]
- linear OA(8125, 6562, F81, 13) (dual of [6562, 6537, 14]-code), using the expurgated narrow-sense BCH-code C(I) with length 6562 | 814−1, defining interval I = [0,6], and minimum distance d ≥ |{−6,−5,…,6}|+1 = 14 (BCH-bound) [i]
- linear OA(815, 17, F81, 5) (dual of [17, 12, 6]-code or 17-arc in PG(4,81)), using
- discarding factors / shortening the dual code based on linear OA(815, 81, F81, 5) (dual of [81, 76, 6]-code or 81-arc in PG(4,81)), using
- Reed–Solomon code RS(76,81) [i]
- discarding factors / shortening the dual code based on linear OA(815, 81, F81, 5) (dual of [81, 76, 6]-code or 81-arc in PG(4,81)), using
- construction X applied to C([0,9]) ⊂ C([0,6]) [i] based on
- discarding factors / shortening the dual code based on linear OA(8142, 6579, F81, 19) (dual of [6579, 6537, 20]-code), using
- embedding of OOA with Gilbert–Varšamov bound [i] based on linear OA(8142, 3587, F81, 19) (dual of [3587, 3545, 20]-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.
Other Results with Identical Parameters
None.
Depending Results
None.