Coding for a multiple access OR channel: A survey

The signature coding for M active users out of T total users over a multiple access OR channel is considered. The mathematical problem is equivalent to the M-cover-free problem of extremal set theory. We survey the upper and lower bounds on the minimal code word length n(T,M), and present some code constructions. According to the current state of the theory, for [email protected][email protected]?T12M^2logMlogT=

[1]  Zoltán Füredi.  On r-Cover-free Families , 1996, J. Comb. Theory, Ser. A.

[2]  Superimposed codes are almost big distance ones , 1997, Proceedings of IEEE International Symposium on Information Theory.

[3]  Jack K. Wolf,et al.  Born again group testing: Multiaccess communications , 1985, IEEE Trans. Inf. Theory.

[4]  Vojtech Rödl,et al.  On a Packing and Covering Problem , 1985, Eur. J. Comb..

[5]  Jacobus H. van Lint,et al.  Generalized Reed - Solomon codes from algebraic geometry , 1987, IEEE Trans. Inf. Theory.

[6]  Peter Frankl,et al.  On Sperner Families Satisfying an Additional Condition , 1976, J. Comb. Theory, Ser. A.

[7]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[8]  Valdemar Cardoso da Rocha,et al.  Maximum distance separable multilevel codes , 1984, IEEE Trans. Inf. Theory.

[9]  Emanuel Knill,et al.  Non-adaptive Group Testing in the Presence of Errors , 1998, Discret. Appl. Math..

[10]  Sundar Vishwanathan,et al.  Locality based graph coloring , 1993, STOC.

[11]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[12]  A. Sterrett.  On the Detection of Defective Members of Large Populations , 1957 .

[13]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[14]  Elwyn R. Berlekamp,et al.  Some long cyclic linear binary codes are not so bad , 1974, IEEE Trans. Inf. Theory.

[15]  Arkadii G. D'yachkov,et al.  A survey of superimposed code theory , 1983 .

[16]  Miklós Ruszinkó,et al.  On the upper bound of the size of the r -cover-free families , 1994 .

[17]  R. Dorfman.  The Detection of Defective Members of Large Populations , 1943 .

[18]  Victor Zinoviev,et al.  An improvement of the Gilbert bound for constant weight codes , 1987, IEEE Trans. Inf. Theory.

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

[20]  R. Blahut.  Theory and practice of error control codes , 1983 .

[21]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[22]  Robert T. Chien,et al.  An application of coding theory to document retrieval , 1966, IEEE Trans. Inf. Theory.

[23]  M. Sobel,et al.  Group testing to eliminate efficiently all defectives in a binomial sample , 1959 .

[24]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

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

[26]  Arkadii G. D'yachkov,et al.  New constructions of superimposed codes , 2000, IEEE Trans. Inf. Theory.

[27]  F. Hwang.  A Method for Detecting all Defective Members in a Population by Group Testing , 1972 .