Analysis of protocol sequences for slow frequency hopping

Authors:
László Györfi;István Vajda
Affiliations:
Department of Computer Science and Information Theory, Technical University of Budapest, H-1521, Budapest Stoczek u. 2, Hungary;Department of Telecommunications, Technical University of Budapest, H-1521, Budapest Stoczek u. 2, Hungary
Venue:
Wireless Networks
Year:
1998

Citing 3
Cited 0

Spread spectrum communications; vols. 1-3

Spread spectrum communications; vols. 1-3
Introduction to finite fields and their applications

Introduction to finite fields and their applications
Making transmission schedules immune to topology changes in multi-hop packet radio networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An error probability bound for protocol sequences is derived for frame asynchronous access on a slow frequency hopping channel. This bound depends on the maximum and average cyclic Hamming correlation properties of the protocol sequences used. Constructions of protocol sequences with good cyclic correlation properties are given.