Abstract.
In this paper, twenty new codes of dimension 6 are presented which give improved bounds on the maximum possible minimum distance of quaternary linear codes. These codes belong to the class of quasi-twisted (QT) codes, and have been constructed using a stochastic optimization algorithm, tabu search. A table of upper and lower bounds for d 4(n,6) is presented for n≤ 200.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 20 December 1996 / Accepted: 13 May 1997
Rights and permissions
About this article
Cite this article
Gulliver, T., Östergård, P. Improved Bounds for Quaternary Linear Codes of Dimension 6. AAECC 9, 153–159 (1998). https://doi.org/10.1007/s002000050100
Issue Date:
DOI: https://doi.org/10.1007/s002000050100