Analysis of protocol sequences for slow frequency hopping

Sandor Csibi, L. Györfi, Istvan Vajda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationInternational Zurich Seminar on Digital Communications
Editors Anon
PublisherIEEE
Pages237-242
Number of pages6
Publication statusPublished - 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

Frequency hopping
Decoding
Error probability

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Csibi, S., Györfi, L., & Vajda, I. (1998). Analysis of protocol sequences for slow frequency hopping. In Anon (Ed.), International Zurich Seminar on Digital Communications (pp. 237-242). IEEE.

Analysis of protocol sequences for slow frequency hopping. / Csibi, Sandor; Györfi, L.; Vajda, Istvan.

International Zurich Seminar on Digital Communications. ed. / Anon. IEEE, 1998. p. 237-242.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Csibi, S, Györfi, L & Vajda, I 1998, Analysis of protocol sequences for slow frequency hopping. in Anon (ed.), International Zurich Seminar on Digital Communications. IEEE, pp. 237-242, Proceedings of the 1998 International Zurich Seminar on Digital Communications, IZS'98, Zurich, Switz, 2/17/98.
Csibi S, Györfi L, Vajda I. Analysis of protocol sequences for slow frequency hopping. In Anon, editor, International Zurich Seminar on Digital Communications. IEEE. 1998. p. 237-242
Csibi, Sandor ; Györfi, L. ; Vajda, Istvan. / Analysis of protocol sequences for slow frequency hopping. International Zurich Seminar on Digital Communications. editor / Anon. IEEE, 1998. pp. 237-242
@inproceedings{d566748bc2764ad1aed59141f3639890,
title = "Analysis of protocol sequences for slow frequency hopping",
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.",
author = "Sandor Csibi and L. Gy{\"o}rfi and Istvan Vajda",
year = "1998",
language = "English",
pages = "237--242",
editor = "Anon",
booktitle = "International Zurich Seminar on Digital Communications",
publisher = "IEEE",

}

TY - GEN

T1 - Analysis of protocol sequences for slow frequency hopping

AU - Csibi, Sandor

AU - Györfi, L.

AU - Vajda, Istvan

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031652844&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031652844&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0031652844

SP - 237

EP - 242

BT - International Zurich Seminar on Digital Communications

A2 - Anon, null

PB - IEEE

ER -