Name
Abstract | ||
|---|---|---|
Given a q-ary frequency hopping sequence set of length n and size M with Hamming correlation H, one can obtain a q-ary (nonlinear) cyclic code of length n and size nM with Hamming distance n-H. Thus, every upper bound on the size of a code from coding theory gives an upper bound on the size of a frequency hopping sequence set. Indeed, all upper bounds from coding theory have been converted to uppe... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TIT.2019.2951383 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Upper bound,Correlation,Probabilistic logic,Chaotic communication,Hamming distance,Tools | Discrete mathematics,Gilbert–Varshamov bound,Upper and lower bounds,Cyclic code,Probabilistic method,Coding theory,Hamming distance,Code (cryptography),Frequency-hopping spread spectrum,Mathematics | Journal |
Volume | Issue | ISSN |
66 | 2 | 0018-9448 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xianhua Niu | 1 | 3 | 1.42 |
| Chaoping Xing | 2 | 12 | 2.59 |
| Chen Yuan | 3 | 27 | 12.30 |