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

Udaya, Paramapalli and Siddiqi, Mohammad Umar (1998) Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings. IEEE Transactions on Information Theory, 44 (4). pp. 1492-1503. ISSN 0018-9448

PDF (Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings) - Published Version Restricted to Repository staff only Download (673kB) | Request a copy

Abstract

We construct new sequences over finite rings having optimal Hamming correlation properties. These sequences are useful in frequency hopping multiple-access (FHMA) spreadspectrum 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

Item Type:	Article (Journal)
Additional Information:	5072/14019
Uncontrolled Keywords:	Frequency hopping patterns, GGMW sequences, linear complexity, nonlinear sequences, sequences over finite rings
Subjects:	T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5101 Telecommunication. Including telegraphy, radio, radar, television
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Engineering
Depositing User:	Prof. Mohammad Umar Siddiqi
Date Deposited:	22 Jul 2013 11:24
Last Modified:	22 Jul 2013 11:24
URI:	http://irep.iium.edu.my/id/eprint/14019

Actions (login required)

View Item