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

Pippenger (1981) showed in a probabilistic way that the capacity of a collision channel with multiplicity feedback is one. In this correspondence, using an Erdos-Renyi type search strategy, we settle a long-standing open problem by giving a constructive proof of this result. Moreover, we prove that two different capacity definitions are equivalent, thereby solving a problem posed by Tsybakov (1985).

[1]  S. Sanders,et al.  Solution of Problem , 1929 .

[2]  F. G. Foster.  On the Stochastic Matrices Associated with Certain Queuing Processes , 1953 .

[3]  H. S. Shapiro,et al.  A Combinatory Detection Problem , 1963 .

[4]  B. Lindström.  On a Combinatorial Problem in Number Theory , 1965, Canadian Mathematical Bulletin.

[5]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[6]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[7]  Nicholas Pippenger,et al.  Bounds on the performance of protocols for a multiple-access broadcast channel , 1981, IEEE Trans. Inf. Theory.

[8]  Pierre A. Humblet,et al.  A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels , 1985, IEEE Trans. Commun..

[9]  BORIS S. TSYBAKOV.  Survey of USSR contributions to random multiple-access communications , 1985, IEEE Trans. Inf. Theory.

[10]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[11]  Shivendra S. Panwar.  On Achieving A Throughput Of One For A Random Access Channel With Collisions Of Known Multiplicity , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[12]  László Györfi,et al.  Constructions of binary constant-weight cyclic codes and cyclically permutable codes , 1992, IEEE Trans. Inf. Theory.

[13]  László Györfi,et al.  Constructions of protocol sequences for multiple access collision channel without feedback , 1993, IEEE Trans. Inf. Theory.