How an Erdös-Rényi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback

IEEE Transactions on Information Theory

Volumn 43, Issue 1, 1997, Pages 368-373

  Ruszinkó, Miklós ^b   Vanroose, Peter ^a,c  

^a IEEE

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Adaptive and parallel search; Capacity; Code construction; Coin weighing problem; Collision channel; Collision resolution protocol; Multiplicity feedback

Indexed keywords

CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); ENCODING (SYMBOLS); MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

ADAPTIVE SEARCH; COIN WEIGHING PROBLEM; COLLISION CHANNEL; COLLISION RESOLUTION PROTOCOL; MULTIPLICITY FEEDBACK; PARALLEL SEARCH;

DATA COMMUNICATION SYSTEMS;

EID: 0030735104     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.567769     Document Type: Article

References (19)

1. N. Q. A, L. Györfi, and J. L. Massey, "Constructions of binary constant-weight cyclic codes and cyclically permutable codes," IEEE Trans. Inform. Theory, vol. 38, no. 3, pp. 940-949, May 1992.
2. N. Abramson, "The ALOHA system - Another alternative for computer communications," in AFIPS Conf. Proc. (Fall Joint Computer Conf.), 1970, vol. 37, pp. 281-285.
3. J. I. Capetanakis, "Tree algorithms for packet broadcast channels," IEEE Trans. Inform. Theory, vol. IT-25, no. 6, pp. 505-519, Nov. 1979.
4. P. Erdös and A. Rényi, "On two problems of information theory," Publ. Math. Inst. Hung. Acad. Sci., vol. 8, pp. 241-254, 1963.
5. N. I. Fine, "Solution of problem E 1399," Amer. Math. Monthly, vol. 67, p. 697, 1960.
6. F. G. Foster, "On stochastic matrices associated with certain queuing problems," Ann. Math. Stat., vol. 24, pp. 355-360, 1953.
7. L. Györfi, "A code for multiple access adder channel," in Open Problems 4th Joint Swedish-Soviet Int. Workshop on Information Theory (Gotland, Sweden, Aug. 1989), pp. 13-15.
8. L. Györfi and I. Vajda, "Constructions of protocol sequences for multiple access collision channel without feedback," IEEE Trans. Inform. Theory, vol. 39, no. 5, pp. 1762-1765, Nov. 1993.
9. B. Lindström, "On a combinatory detection problem I," Publ. Math. Inst. Hung. Acad. Sci., vol. 9, pp. 195-207, 1964.
10. _, "On a combinatorial problem in number theory," Can. Math. Bull., vol. 8, no. 4, pp. 477-490, 1965.
11. J. L. Massey and P. Mathys, "The collision channel without feedback," IEEE Trans. Inform. Theory, vol. IT-31, no. 2, pp. 192-204, Mar. 1985.
12. J. Mosely and P. A. Humblet, "A class of efficient contention resolution algorithms for multiple-access channels," IEEE Trans. Commun., vol. COM-33, no. 2, pp. 145-151, Feb. 1985.
13. S. S. Panwar, "On achieving a throughput of one for a random access channel with collisions of known multiplicity," in Proc. IEEE Int. Symp. on Information Theory (Budapest, Hungary, June 1991), p. 337.
14. N. Pippenger, "Bounds on the performance of protocols for a multiple access broadcast channel," IEEE Trans. Inform. Theory, vol. IT-27, no. 2, pp. 145-151, Mar. 1981.
15. H. S. Shapiro, "Problem E 1399," Amer. Math. Monthly, vol. 67, p. 82, 1960.
16. H. S. Shapiro and S. Söderberg, "A combinatory detection problem," Amer. Math. Monthly, vol. 70, pp. 1066-1070, 1963.
17. B. S. Tsybakov, "Resolution of a conflict of known multiplicity," Probl. Pered. Inform., vol. 16, no. 2, pp. 69-82, 1980.
18. _, "Survey of USSR contributions to random multiple-access communications," IEEE Trans. Inform. Theory, vol. IT-31, no. 2, pp. 143-164, Mar. 1985.
19. B. S. Tsybakov and V. A. Mikhailov, "Free synchronous packet access in a broadcast channel with feedback," Probl. Pered. Inform., vol. 14, no. 4, pp. 32-59, 1978.