2009
DOI: 10.1109/tit.2008.2009856
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
57
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 117 publications
(57 citation statements)
references
References 9 publications
0
57
0
Order By: Relevance
“…Several optimal FHS sets were constructed from algebraic or combinatorial structures [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27].…”
Section: Construction Of Frequency-hopping Sequences Of Length Nnmentioning
confidence: 99%
“…Several optimal FHS sets were constructed from algebraic or combinatorial structures [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27].…”
Section: Construction Of Frequency-hopping Sequences Of Length Nnmentioning
confidence: 99%
“…We found exceptionally convenient the use of the Hamming correlation approach [15] in order to submit a strong enough criterion regarding optimality of a FH code set based on Fig. 4.…”
Section: A System Performance In Sfhss-ma Scenariomentioning
confidence: 99%
“…Both algebraic and combinatorial constructions of such sequences were presented (see for example [2][3][4][6][7][8][11][12][13]18]). Table 1 describes the parameters of some known optimal sets of FH sequences, where the mark " * " means that the linear spans of the FH sequences in these optimal sets are discovered in this paper.…”
Section: Introductionmentioning
confidence: 99%