Abstract
In this paper we provide a combinatorial framework for analysing the
performance of frequency hopping sequences in a multiple access system in the
presence of a communication jammer. We examine the resilience of a scheme based
on Latin squares which achieves maximum throughput and propose further schemes
with the same throughput but better resilience. We also consider the parameters
and trade-offs in the design of good frequency hopping multiple access schemes.
performance of frequency hopping sequences in a multiple access system in the
presence of a communication jammer. We examine the resilience of a scheme based
on Latin squares which achieves maximum throughput and propose further schemes
with the same throughput but better resilience. We also consider the parameters
and trade-offs in the design of good frequency hopping multiple access schemes.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Fourteenth International Workshop on Algebraic and Combinatorial Coding Theory |
| Pages | 271 |
| Number of pages | 276 |
| Publication status | Published - 2014 |