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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N.Q. A, L. Györfi and J.L. Massey, Constructions of binary constant-weight cyclic codes and cyclically permutable codes,IEEE Transactions on Information Theory 38 (May 1992) 940–949.
L.A. Bassalygo and M.S. Pinsker, Limited multiple-access of a nonsynchronous channel, Problems of Information Transmission 19 (1983) 92–96 (in Russian).
R.E. Blahut,The Theory and Practice of Error Control Codes (Addison-Wesley, Reading, MA, 1983).
I. Chlamtac and A. Farago, Makingtransmission schedules immune to topology changes in multi-hop packet radio networks, IEEE Transactions on Networking 94 (February 1994) 23–29.
G. Einarsson, Address assignement for a time-frequency-coded spread spectrum system, Bell Systems TechnicalJournal 59 (1980) 1241–1255.
A. Ephremides, J.E. Wieselthier and D.J. Baker, A design concept for reliable mobile radionetworks with frequency hopping signaling, Proceedings of IEEE 75 (1987) 56–73.
P. Erdös, P. Frankl and Z. Füredi,Families of finite sets in which no set is covered by the union of others, Israel Mathematical Journal 51 (1985) 79–89.
A.G. Dyachkov and V.V. Rykov, A survey of superimposed code theory, Problems of Control and Information Theory 12(1983) 3–12.
L. Györfi and I. Vajda, Constructions of protocol sequences for multiple access collision channel without feedback,IEEE Transactions on Information Theory 39 (September 1993) 1762–1765.
W. Hoeffding, Probability inequalities forsums of bounded random variables, Journal of the American Statistical Association 58 (1963) 13–30.
W.H. Kautz and R.C. Singleton, Nonrandom binary superimposed codes, IEEE Transactions on Information Theory 10 (1964) 363–377.
R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications (Cambridge University Press, 1986).
F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes (North-Holland, Amsterdam, 1977).
J.L. Massey and P. Mathys, The collision channel without feedback, IEEE Transactions on Information Theory 31 (March 1985) 192–204.
M.B. Pursley, Spread spectrum in packet radio networks, Proceedings of IEEE 75 (1987) 116–134.
M.K. Simon, J.K. Omura, R.A. Scholtz and B.K. Levitt, Spread Spectrum Communications (Computer Society Press, 1985).
B.S. Tsybakov and N.B. Likhanov, Packet communication on a channel without feedback, Problems of Information Transmission 19 (1983) 69–84.
I. Vajda, Code sequences for a frequency-hopping multiple-access systems, IEEE Transactions onCommunications 43 (October 1995) 2553–2554.
I. Vajda and G. Einarsson, Code acquisition for a frequency-hoppingsystem, IEEE Transactions on Communications 35 (May 1987) 566–568.
N. Zierler, Linear recurring sequences,SIAM Journal 7 (1959) 31–48.
V.A. Zinovjev, Cascade of equal weight codes and maximal packing, Problems ofControl and Information Theory 12 (1983) 3–9.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Györfi, L., Vajda, I. Analysis of protocol sequences for slow frequency hopping. Wireless Networks 4, 411–418 (1998). https://doi.org/10.1023/A:1019185129863
Issue Date:
DOI: https://doi.org/10.1023/A:1019185129863