Results 251 to 260 of about 4,433,394 (276)
Some of the next articles are maybe not open access.
New Bounds on Wide-Gap Frequency-Hopping Sequences
IEEE Communications Letters, 2019In a frequency-hopping (FH) system, to avoid that the received signal would be prone to be interfered, the equipped FH sequence of each user should have wide FH gap, i.e., the adjacent two frequencies should have some gap. In this letter, we extend the Lempel–Greenberger bound and Peng-Fan bounds for wide-gap frequency-hopping sequences (WGFHSs).
Peihua Li +3 more
openaire +1 more source
Code sequences for frequency-hopping multiple-access systems
IEEE Transactions on Communications, 1995Summary: 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, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Optimal wide-gap-zone frequency hopping sequences
Advances in Mathematics of CommunicationszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qin Shu +4 more
openaire +3 more sources
Randomness of frequency hopping sequences generated by Hermitian codes
Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications, 2002Frequency hopping sequences generated by either Reed Solomon (RS) or Hermitian codes (AG) are compared. The results show that AG codes do better than RS codes if the ratio of the number of hits by length of sequences is considered.
openaire +1 more source
A new frequency-hopping sequence set based upon generalized cyclotomy
Designs, Codes, and Cryptography, 2012Zhengchun Zhou, Daiyuan Peng
exaly
Constructions of optimal low-hit-zone frequency hopping sequence sets
Designs, Codes, and Cryptography, 2016Limengnan Zhou +2 more
exaly
New Bound on Frequency Hopping Sequence Sets and Its Optimal Constructions
IEEE Transactions on Information Theory, 2011Xiaohu Tang +2 more
exaly

