Results 251 to 260 of about 4,433,394 (276)

Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions

IEEE Transactions on Information Theory, 2009
Frequency hopping spread spectrum and direct sequence spread spectrum are two main spread coding technologies in communication systems. Frequency hopping sequences are needed in frequency hopping code-division multiple-access (FH-CDMA) systems. In this paper, four algebraic and a combinatorial constructions of optimal sets of frequency hopping ...
Cunsheng Ding, Ryoh Fuji-Hara, Yuichiro Fujiwara, Masakazu Jimbo, Miwako Mishima   +4 more
openaire   +3 more sources

Theoretical bound on no hit zone of frequency hopping sequences

Proceedings of the Fifth International Workshop on Signal Design and Its Applications in Communications, 2011
Frequency-hopping (FH) sequences with no hit zone (NHZ) can be employed in quasi-synchronous FH code-division multiple-access (CDMA) systems to eliminate multiple-access interference. In this paper, a new theoretical bound on NHZ of FH sequences is derived. Numerical results show that the new bound is tighter than the existing bounds.
Wenxia Ye, Pingzhi Fan, Daiyuan Peng, Naoki Suehiro   +3 more
openaire   +1 more source

Frequency/Time Hopping Sequences with Large Linear Complexities

2006
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk) by taking successive k-tuples of given sequences over GF(p). We are able to characterize those p-ary sequences whose k-tuple versions now over GF(pk) have the maximum possible linear complexities (LCs).
Yun-Pyo Hong, Hong-Yeop Song
openaire   +2 more sources

Code sequences for frequency-hopping multiple-access systems

IEEE Transactions on Communications, 1995
Summary: A new code construction is given for slow frequency-hopping multiple-access channels. The construction is based on the cyclic concatenation of special subcodes of two Reed-Solomon codes.
openaire   +3 more sources

The linear span of the frequency hopping sequences in optimal sets

Designs, Codes and Cryptography, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields

IEEE Transactions on Information Theory, 2020
Chaoping Xing, Xianhua Niu
exaly  

A study of Bluetooth Frequency Hopping sequence

2011
openaire   +1 more source

A new frequency-hopping sequence set based upon generalized cyclotomy

Designs, Codes, and Cryptography, 2012
Zhengchun Zhou, Daiyuan Peng
exaly  

Constructions of optimal low-hit-zone frequency hopping sequence sets

Designs, Codes, and Cryptography, 2016
Limengnan Zhou, Zheng Ma, Daiyuan Peng   +2 more
exaly  

New Bound on Frequency Hopping Sequence Sets and Its Optimal Constructions

IEEE Transactions on Information Theory, 2011
Xiaohu Tang, Udaya Parampalli, Daiyuan Peng   +2 more
exaly