Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes

被引：80

作者：

Ding, Cunsheng ^{[1
]}

Yang, Yang ^{[2
]}

Tang, Xiaohu ^{[2
]}

机构：

[1] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong, Peoples R China

[2] SW Jiaotong Univ, Inst Mobile Commun, Chengdu 610031, Sichuan, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2010年 / 56卷 / 07期

基金：

美国国家科学基金会;

关键词：

Cyclic codes; direct sequence spread spectrum; frequency hopping sequence; frequency hopping spread spectrum; irreducible cyclic codes; WEIGHT DISTRIBUTIONS; GAUSS SUMS; CONSTRUCTIONS; DESIGNS; BOUNDS;

D O I：

10.1109/TIT.2010.2048504

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In communication systems, frequency hopping spread spectrum and direct sequence spread spectrum are two main spread coding technologies. Frequency hopping sequences are used in FH-CDMA systems. In this paper, an earlier idea of constructing optimal sets of frequency hopping sequences is further investigated. New optimal parameters of sets of frequency hopping sequences are obtained with subcodes of the Reed-Solomon codes. Optimal sets of frequency hopping sequences are constructed with a class of irreducible cyclic codes. As a byproduct, the weight distribution of a subclass of irreducible cyclic codes is determined.

引用

页码：3605 / 3612

页数：8

共 35 条

[1]

Baumert L.D., 1973, DSN Progr. Rep, V16, P128

[2] WEIGHTS OF IRREDUCIBLE CYCLIC CODES [J].

BAUMERT, LD ;

MCELIECE, RJ .

INFORMATION AND CONTROL, 1972, 20 (02) :158-&

[3] THE GEOMETRY OF 2-WEIGHT CODES [J].

CALDERBANK, R ;

KANTOR, WM .

BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 1986, 18 :97-122

[4] Optimal frequency-hopping sequences via cyclotomy [J].

Chu, WS ;

Colbourn, CJ .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) :1139-1141

[5]

Delsarte P., 1970, P 2 CHAPEL HILL C CO, P100

[6]

Ding C., 2008, P 1 INT WORKSH COD T, P119

[7] Sets of optimal frequency-hopping sequences [J].

Ding, Cunsheng ;

Yin, Jianxing .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) :3741-3745

[8] Algebraic constructions of optimal frequency-hopping sequences [J].

Ding, Cunsheng ;

Moisio, Marko J. ;

Yuan, Jin .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (07) :2606-2610

[9] Complex codebooks from combinatorial designs [J].

Ding, Cunsheng .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (09) :4229-4235

[10] Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions [J].

Ding, Cunsheng ;

Fuji-Hara, Ryoh ;

Fujiwara, Yuichiro ;

Jimbo, Masakazu ;

Mishima, Miwako .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3297-3304

← 1 2 3 4 →