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

DOI10.1023/A:1026513628412MaRDI QIDQ5933516zbMATH OpenFDO

Authors T. Aaron Gulliver, Patric R. J. Östergård

Publication date 6 August 2001

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1026513628412

zbMATH Keywords

Griesmer boundtabu searchternary codes

Mathematics Subject Classification ID

Marketing, advertising (90B60) Arithmetic codes (94B40)

Review text

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.\)

Recommendations

• Improved bounds for ternary linear codes of dimension 7
• scientific article; zbMATH DE number 822738
• Improvements to the bounds on optimal ternary linear codes of dimension 6
• Optimal ternary quasi-cyclic codes
• Improved bounds for quaternary linear codes of dimension 6.

Cited in

(3)

• New bounds on binary linear codes of dimension eight (Corresp.)
• Improved bounds for ternary linear codes of dimension 7
• A new iterative computer search algorithm for good quasi-twisted codes

This page was built for publication: Improved bounds for ternary linear codes of dimension 8 using tabu search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933516)