Improved bounds for ternary linear codes of dimension 7
Thomas Aaron Gulliver, Patric R. J. Östergård · IEEE Transactions on Information Theory · 1997
New codes of dimension 7 are presented which give improved bounds on the maximum possible minimum distance of ternary linear codes. These codes belong to the class of quasi-cyclic codes, and have been constructed using a stochastic optimization algorithm, tabu search. Thirty-two codes are given which improve or establish the current bounds for ternary codes. In addition, a table of upper and lower bounds for d/sub 3/(n, 7) is presented for n/spl les/240.