Improved bounds for ternary linear codes of dimension 8 using tabu search
In this paper. new codes of dimension 8 are presented which give improved bounds on the maximum possible minimum distance of ternary linear codes. These codes belong to the class of quasi-twisted (QT) codes, and have been constructed using a stochastic optimization algorithm, tabu search. Twenty three 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 presented for n less than or equal to 200.
ternary linear codes tabu search quasi-twisted codes