Improved Bounds for Quaternary Linear Codes of Dimension 6 |
| |
| Authors: | T Aaron Gulliver Patric RJ Östergård |
| |
| Affiliation: | (1) Department of Electrical and Electronic Engineering, University of Canterbury, Private Bag 4800, Christchurch, New Zealand, (e-mail: gulliver@elec.canterbury.ac.nz), NZ;(2) Department of Computer Science, Helsinki University of Technology, Otakaari 1, FIN-02150 Espoo, Finland, (e-mail: Patric.Ostergard@hut.fi), FI |
| |
| 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.
Received: 20 December 1996 / Accepted: 13 May 1997 |
| |
| Keywords: | : Quasi-cyclic codes Quaternary linear codes Tabu search |
| 本文献已被 SpringerLink 等数据库收录！ |
|
