Analysis of protocol sequences for slow frequency hopping

Sandor Csibi, Laszlo Gyorfi, Istvan Vajda

Research output: Contribution to conferencePaper

Abstract

Decoding error probability bounds are derived for slow frequency hopping schemes. For unslotted asynchronous multiple access random of protocol sequences with interleaved codes are considered. Non-random constructions of protocol sequences with good cyclic correlation properties are given. For slotted access the maximum and average Hamming correlation properties of these protocol sequences imply error bounds.

Original languageEnglish
Pages237-242
Number of pages6
Publication statusPublished - Jan 1 1998
EventProceedings of the 1998 International Zurich Seminar on Digital Communications, IZS'98 - Zurich, Switz
Duration: Feb 17 1998Feb 19 1998

Other

OtherProceedings of the 1998 International Zurich Seminar on Digital Communications, IZS'98
CityZurich, Switz
Period2/17/982/19/98

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Csibi, S., Gyorfi, L., & Vajda, I. (1998). Analysis of protocol sequences for slow frequency hopping. 237-242. Paper presented at Proceedings of the 1998 International Zurich Seminar on Digital Communications, IZS'98, Zurich, Switz, .