NEW OPTIMAL TERNARY LINEAR CODES

被引:14
作者
GULLIVER, TA
机构
[1] Department of Systems and Computer Engineering, Carleton University, Ottawa, Ont.
关键词
QUASI-TWISTED CODES; HEURISTIC SEARCH; OPTIMAL CODES OVER GF(3);
D O I
10.1109/18.391267
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The class of quasi-twisted (QT) codes is a generalization of the class of quasi-cyclic codes, similar to the way constacyclic codes are a generalization of cyclic codes. In this paper, rate 1/p QT codes over GF(3) are presented which have been constructed using integer linear programming and heuristic combinatorial optimization. Many of these attain the maximum possible minimum distance for any linear code with the given parameters, and several improve the maximum known minimum distances. Two of these new codes, namely (90, 6, 57) and (120, 6, 78), are optimal and so prove that d(3)(90, 6) = 57 and d(3)(120, 6) = 78.
引用
收藏
页码:1182 / 1185
页数:4
相关论文
共 14 条
[1]   LOCAL SEARCH IN CODING THEORY [J].
AARTS, EHL ;
VANLAARHOVEN, PJM .
DISCRETE MATHEMATICS, 1992, 106 :11-18
[2]  
BERLEKAMP ER, 1968, ALGEBRAIC CODING THE
[3]  
BROUWER AE, TABLE MINIMUM DISTAN
[4]  
CHEPYZHOV V, 1993, AUG P JOINT SWED RUS, P214
[5]  
DASKALOV RN, 1992, TABLE BOUNDS LINEAR
[6]  
Greenough P. P., 1992, Designs, Codes and Cryptography, V2, P81, DOI 10.1007/BF00124211
[7]   SOME BEST RATE 1/P AND RATE (P-1)/P SYSTEMATIC QUASI-CYCLIC CODES OVER GF(3) AND GF(4) [J].
GULLIVER, TA ;
BHARGAVA, VK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (04) :1369-1374
[8]  
HILL R, 1992, JUN P INT WORKSH ALG, P92
[9]   SOME TERNARY AND QUATERNARY CODES AND ASSOCIATED SPHERE PACKINGS [J].
KSCHISCHANG, FR ;
PASUPATHY, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (02) :227-246
[10]  
Macwilliams F. J., 1977, THEORY ERROR CORRECT