Cover Image

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

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 Hammi...

Full description

Saved in:
Bibliographic Details
Main Authors: Udaya, Paramapalli, Siddiqi, Mohammad Umar
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers Inc. 1998
Subjects:
TK5101 Telecommunication. Including telegraphy, radio, radar, television
Online Access:http://irep.iium.edu.my/14019/1/Optimal_Large_Linear_Complexity_Frequency_Hopping_Patterns_Derived_from_Polynomial_Residue_Class_Rings.pdf
http://irep.iium.edu.my/14019/
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=681324&sortType%3Dasc_p_Sequence%26filter%3DAND%28p_IS_Number%3A14976%29
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.iium.irep.14019
record_format dspace
spelling my.iium.irep.140192013-07-22T03:24:07Z http://irep.iium.edu.my/14019/ Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings Udaya, Paramapalli Siddiqi, Mohammad Umar TK5101 Telecommunication. Including telegraphy, radio, radar, television 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 Institute of Electrical and Electronics Engineers Inc. 1998 Article REM application/pdf en http://irep.iium.edu.my/14019/1/Optimal_Large_Linear_Complexity_Frequency_Hopping_Patterns_Derived_from_Polynomial_Residue_Class_Rings.pdf 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 http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=681324&sortType%3Dasc_p_Sequence%26filter%3DAND%28p_IS_Number%3A14976%29 10.1109/18.681324
institution Universiti Islam Antarabangsa Malaysia
building IIUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider International Islamic University Malaysia
content_source IIUM Repository (IREP)
url_provider http://irep.iium.edu.my/
language English
topic TK5101 Telecommunication. Including telegraphy, radio, radar, television
spellingShingle TK5101 Telecommunication. Including telegraphy, radio, radar, television
Udaya, Paramapalli
Siddiqi, Mohammad Umar
Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
description 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
format Article
author Udaya, Paramapalli
Siddiqi, Mohammad Umar
author_facet Udaya, Paramapalli
Siddiqi, Mohammad Umar
author_sort Udaya, Paramapalli
title Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
title_short Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
title_full Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
title_fullStr Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
title_full_unstemmed Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
title_sort optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
publisher Institute of Electrical and Electronics Engineers Inc.
publishDate 1998
url http://irep.iium.edu.my/14019/1/Optimal_Large_Linear_Complexity_Frequency_Hopping_Patterns_Derived_from_Polynomial_Residue_Class_Rings.pdf
http://irep.iium.edu.my/14019/
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=681324&sortType%3Dasc_p_Sequence%26filter%3DAND%28p_IS_Number%3A14976%29
_version_ 1643606841102434304
score 13.214268

Similar Items