Abstract
Multiaccess for a Poisson population is considered through a single multi-input, single-output collision channel without feedback for time hopping, and also through L such channels for frequency hopping. Synchronism as well as asynchronism are included. Upper bounds are given on the decoding error probability. Each of these consists of a first term due to overflow (above a threshold that is a design parameter), a second term due to identification error (under no overflow) and a third term due to collision (under neither overflow nor identification error). The third term, exponential in the message length, is obtained by Hoeffding’s inequality for all cases, considering either the original model itself or a well-defined dominating model (with additional erasures generated appropriately). Proofs are given in the first case; just references in the second.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N.Q.A.L. Györfi and J.L. Massey, “Constructions of binary constant-weight cyclic codes and cyclically permutable codes” IEEE Trans. on Information Theory 38, pp. 940–949,1992.
L. A. Bassalygo and M. S. Pinsker, “Limited multiple-access of a nonsynchronous channel”, (in Russian) Problems of Information Transmission XIX, pp. 92–96, 1983.
S. Csibi and L. Györfi, “Coding for multiple access collision channel without feedback and with Poisson arrivals”, Proc. 6th Joint Swedish-Russian International Workshop on Information Theory, pp. 72–75, Mölle, Sweden, August 22–27, 1993.
S. Csibi and L. Györfi, “Exponential bounds and dominating models for CDMA” 12th Prague Conference on Information Theory, Statistical Decision Functions, 1994, (submitted).
S. Csibi and L. Györfi, “More on exponential bounds and dominating models for CDMA ”, IEEE International Workshop on Information Theory, Aksakovo-Moscow, Russia, 1994, (submitted).
F. D. Frank and M. B. Pursley, “On the statistical dependence of hits in frequency-hopping multiple access”, IEEE Trans. on Information Theory, COM-38, pp. 1483–1494, 1990.
W. Hoeffding, “Probability inequalities for sums of bounded random variables”, Journal of the Amer. Stat. Assoc., 58, pp. 13–30, 1963.
J. L. Massey, “The capacity of the collision channel without feedback”, Abstracts of Papers. IEEE Int. Symp. on Info. Theory, p.101, 1982.
J. L. Massey and P. Mathys, “The collision channel without feedback”, IEEE Trans. on Information Theory, IT-31, pp.192–204, 1985.
K. A. Mohamed and L. Pap, “Analysis of frequency-hopped packet radio networks with random signal levels” IEEE Trans. Selected Area in Communications, 1994 (to appear).
N. Pippenger, “Bounds on the performance of the protocols for a multiple-access broadcast channel”, IEEE Trans. on Information Theory, IT-27, pp.145–151, 1981.
B. S. Tsybakov and N. B. Likhanov, “Packet communication on a channel without feedback”, Problems of Information Transmission XIX, pp. 69–84, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Csibi, S., Györfi, L. (1994). Random Time and Frequency Hopping for Infinite User Population. In: Blahut, R.E., Costello, D.J., Maurer, U., Mittelholzer, T. (eds) Communications and Cryptography. The Springer International Series in Engineering and Computer Science, vol 276. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2694-0_9
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2694-0_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6159-6
Online ISBN: 978-1-4615-2694-0
eBook Packages: Springer Book Archive