Results 251 to 260 of about 3,780,505 (270)

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

Constructions of Optimal Uniform Wide-Gap Frequency-Hopping Sequences

IEEE Transactions on Information Theory, 2022
Cuiling Fan, Zhengchun Zhou, Yang Yang   +2 more
exaly  

A study of Bluetooth Frequency Hopping sequence

2011
openaire   +1 more source

Optimal Frequency Hopping Sequences of Odd Length

IEEE Transactions on Information Theory, 2013
Xiaohu Tang, Xiangyong Zeng, Han Cai
exaly  

Linear Programming Bound on Frequency Hopping Sequences

IEEE Transactions on Information Theory
openaire   +2 more sources

Linear Span of the Optimal Frequency Hopping Sequences from Irreducible Cyclic Codes

Chinese Journal of Electronics, 2015
Juntao Gao
exaly  

New Bound on Partial Hamming Correlation of Low-Hit-Zone Frequency Hopping Sequences and Optimal Constructions

IEEE Communications Letters, 2018

exaly  

New Classes of Frequency-Hopping Sequences With Optimal Partial Correlation

IEEE Transactions on Information Theory, 2012
Zhengchun Zhou, Xiaohu Tang, Udaya Parampalli   +2 more
exaly