Improved Bounds for Ternary Linear Codes of Dimension 8 Using Tabu Search

Authors:
T. Aaron Gulliver;Patric R. J. Östergård
Affiliations:
Department of Electrical and Electronic Engineering, University of Canterbury, Private Bag 4800, Christchurch, New Zealand. gulliver@elec.canterbury.ac.nz;Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, 02015 HUT, Finland. patric.ostergard@hut.fi
Venue:
Journal of Heuristics
Year:
2001

Citing 5
Cited 0

New Good Rate (m-1)/pm Ternary and Quaternary Quasi-Cyclic Codes

Designs, Codes and Cryptography
Tabu Search

Tabu Search
Codes spanned by quadratic and Hermitian forms

IEEE Transactions on Information Theory
New code parameters from Reed-Solomon subfield codes

IEEE Transactions on Information Theory
Improved bounds for ternary linear codes of dimension 7

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 d3(n, 8) is presented for n ≤ 200.