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

Authors
Gulliver, TA Ostergard, PRJ
Citation
Ta. Gulliver et Prj. Ostergard, Improved bounds for ternary linear codes of dimension 8 using tabu search, J HEURISTIC, 7(1), 2001, pp. 37-46
Citations number
15
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
JOURNAL OF HEURISTICS
ISSN journal
13811231 → ACNP
Volume
7
Issue
1
Year of publication
2001
Pages
37 - 46
Database
ISI
SICI code
1381-1231(200101)7:1<37:IBFTLC>2.0.ZU;2-Q
Abstract
In this paper. new codes of dimension 8 are presented which give improved b ounds on the maximum possible minimum distance of ternary linear codes. The se codes belong to the class of quasi-twisted (QT) codes, and have been con structed using a stochastic optimization algorithm, tabu search. Twenty thr ee codes are given which improve or establish the bounds for ternary codes. In addition, a table of upper and lower bounds for d(3) (n, 8) is presente d for n less than or equal to 200.