Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings

被引：95

作者：

Udaya, P ^{[1
]}

Siddiqi, MU

机构：

[1] Univ Melbourne, RMIT, Dept Math, Melbourne, Vic 3001, Australia

[2] Indian Inst Technol, Dept Elect Engn, Kanpur 208016, Uttar Pradesh, India

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1998年 / 44卷 / 04期

关键词：

frequency hopping patterns; GGMW sequences; linear complexity; nonlinear sequences; sequences over finite rings;

D O I：

10.1109/18.681324

中图分类号：

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

学科分类号：

0812 ;

摘要：

We construct new sequences over finite rings having optimal Hamming correlation properties. These sequences are useful in frequency hopping multiple-access (FHMA) spread-spectrum communication systems. Our constructions can be classified into linear and nonlinear categories, both giving optimal Hamming correlations according to Lempel-Greenberger bound, The nonlinear sequences have large linear complexity and can be seen as a generalized version of GMW sequences over fields.

引用

页码：1492 / 1503

页数：12

共 21 条

[1] COMPLEX SEQUENCES OVER GF(PM) WITH A 2-LEVEL AUTOCORRELATION FUNCTION AND A LARGE LINEAR SPAN [J].

ANTWEILER, M ;

BOMER, L .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (01) :120-130

[2]

BACHOC C, 1997, J COMB THEORY A

[3]

BHAT H, 1985, THESIS INDIAN I TECH

[4] 4-PHASE SEQUENCES WITH NEAR-OPTIMUM CORRELATION-PROPERTIES [J].

BOZTAS, S ;

HAMMONS, R ;

KUMAR, PV .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (03) :1101-1113

[5]

Calderbank A. R., 1995, Designs, Codes and Cryptography, V6, P21, DOI 10.1007/BF01390768

[6]

CASEN HL, 1978, THESIS DELFT U TECHN

[7]

Kempner AJ, 1921, T AM MATH SOC, V22, P240, DOI 10.2307/1989020

[8] Polynomials and their residue systems [J].

Kempner, Aubrey J. .

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1921, 22 (1-4) :267-288

[9]

Komo J. J., 1990, IEEE J SEL AREA COMM, V5, P819

[10] FREQUENCY-HOPPING CODE SEQUENCE DESIGNS HAVING LARGE LINEAR SPAN [J].

KUMAR, PV .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (01) :146-151

← 1 2 3 →