Improved bounds for ternary linear codes of dimension 8 using tabu search (Q5933516)

The heuristic search method tabu search is used to produce \(8\)-dimensional ternary error-correcting codes of length \(\leq 200\), which improve the current bounds on code parameters. The codes constructed are quasi-twisted, meaning that they have length \(n=pm\) and are invariant under a cyclic group of order \(m\) which has \(p\) cycles of length \(m\) on the coordinates such that each cycle displays a negacyclic behaviour. The paper results in \(23\) new code parameters, from \([50,8,27]_3\) to \([200,8,124]_3.\)