Generalized cyclotomic codes of length p1e1•••ptet

被引：42
作者：
Ding, CS
Helleseth, T
机构：
[1] Natl Univ Singapore, Sch Comp, Dept Comp Sci, Singapore 119260, Singapore
[2] Univ Bergen, Dept Informat, N-5020 Bergen, Norway
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1999年 / 45卷 / 02期
关键词：
cyclotomy; error-correcting codes; linear codes;
D O I：
10.1109/18.748996
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we first introduce a generalized cyclotomy of order 2 with respect to p(1)(e1) ... p(t)(et), then we present two classes of new error-correcting binary cyclic codes of length p(1)(e1) ... p(t)(et) based on this generalized cyclotomy. We prove either a square-root bound or a similar bound on the minimum odd weight of those codes with length n = p(1)(e1) p(2)(e2).
引用
收藏
页码：467 / 474
页数：8
相关论文
共 17 条
[1]  
[Anonymous], FINITE FIELDS TH APP
[2]  
[Anonymous], J NUMBER THEORY
[3]  
[Anonymous], HDB CODING THEORY
[4]  
Apostol TM., 1998, INTRO ANAL NUMBER TH
[5]  
Baumert L. D., 1971, CYCLIC DIFFERENCE SE
[6]  
Cusick T. W., 1998, STREAM CIPHERS NUMBE
[7]  
DING C, 1995, LECT NOTES COMPUTER, V1008, P29
[8]  
DING C, 1996, CHINESE REMAINDER TH, pCH2
[9]  
Gauss C. F., 1801, Disquisitiones arithmeticae
[10]   DUADIC CODES [J].
LEON, JS ;
MASLEY, JM ;
PLESS, V .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (05) :709-714
12