Author:
Rueppel Rainer A.,Massey James L.
Reference11 articles.
1. J. I. Capetanakis, “Tree algorithms for packet broadcast channels”, IEEE Trans. Inform. Theory, vol. IT-25, pp. 505–515, 1979.
2. R.Cruz and B.Hajek, “A new upper bound to the throughput of a multi-access broadcast channel”, IEEE Trans. Inform. Theory, vol. IT-28, pp. 402–405, 1982.
3. B. Hajek, “Information of partitions with applications to random access communications”, IEEE Trans. Inform. Theory, vol. IT-30, pp. 691–701, 1982.
4. P. A. Humblet, “Bounds on the utilization of ALOHA-like multiple-access broadcast channels”, M.I.T. Cambridge MA, Rep. LIDS-P-1000, June 1980.
5. P. A. Humblet and J. Mosely, “Efficient accessing of a multiaccess channel”, M.I.T Cambridge MA, Rep. LIDS-P-1040, Sept. 1980.