New quasi-cyclic codes over F5

被引：18
作者：
Aydin, N [1 ]
Siap, I [1 ]
机构：
[1] Ohio State Univ, Dept Math, Columbus, OH 43210 USA
来源：
APPLIED MATHEMATICS LETTERS | 2002年 / 15卷 / 07期
关键词：
quasi-cyclic codes; linear codes over F-5; new bounds;
D O I：
10.1016/S0893-9659(02)00050-2
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
One of the most important problems of coding theory is to construct codes with best possible minimum distances. In this paper, we use the algebraic structure of quasi-cyclic codes and the BCH type bound on the minimum distance to search for quasi-cyclic codes over F-5, the finite field with five elements, which improve the minimum distances of best-known linear codes. We construct 15 new linear codes of this type. (C) 2002 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：833 / 836
页数：4
相关论文
共 12 条
[1]  
AYDIN N, IN PRESS DES CODES C
[2]  
Brouwer AE, 1998, HANDBOOK OF CODING THEORY, VOLS I & II, P295
[3]  
BROUWER AE, BOUNDS MINIMUM DISTA
[4]   New good quasi-cyclic ternary and quaternary linear codes [J].
Daskalov, RN ;
Gulliver, TA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (05) :1647-1650
[5]   Bounds on minimum distance for linear codes over GF(5) [J].
Daskalov, RN ;
Gulliver, TA .
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1999, 9 (06) :547-558
[6]   New ternary linear codes [J].
Daskalov, RN ;
Gulliver, TA ;
Metodieva, E .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) :1687-1688
[7]  
Greenough P. P., 1992, Designs, Codes and Cryptography, V2, P81, DOI 10.1007/BF00124211
[8]   GILBERT-VARSHAMOV BOUND FOR QUASI-CYCLIC CODES OF RATE 1-2 [J].
KASAMI, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (05) :679-679
[9]  
LALLY K, IN PRESS DISC APPL M
[10]   New ternary quasi-cyclic codes with better minimum distances [J].
Siap, I ;
Aydin, N ;
Ray-Chaudhuri, DK .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (04) :1554-1558
12