Improved bounds for quaternary linear codes of dimension 6

被引：4
|
作者：
Gulliver, TA
Ostergard, PRJ
机构：
[1] Univ Canterbury, Dept Elect & Elect Engn, Christchurch, New Zealand
[2] Helsinki Univ Technol, Dept Comp Sci, FIN-02150 Espoo, Finland
来源：
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 1998年 / 9卷 / 02期
关键词：
quasi-cyclic codes; quaternary linear codes; tabu search;
D O I：
10.1007/s002000050100
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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 less than or equal to 200.
引用
收藏
页码：153 / 159
页数：7
相关论文
共 50 条
12345