Single-user tracing and disjointly superimposed codes

The zero-error capacity region of r-out-of-T user multiple-access OR channel is investigated. A family F of subsets of [n] = {1, ..., n} is an r-single-user-tracing superimposed code (r-SUT) if there exists such a single-user-tracing function /spl phi/:2/sup [n]/ /spl rarr/ F that for all F' /spl sube/ F with 1 /spl les/ |F'| /spl les/ r, /spl phi/(/spl cup//sub A/spl isin/F/'A) /spl isin/ F'. In this correspondence, we introduce the concept of these codes and give bounds on their rate. We also consider disjointly r-superimposed codes.

[1]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

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

[3]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

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

[5]  E. Lander,et al.  Genomic mapping by fingerprinting random clones: a mathematical analysis. , 1988, Genomics.

[6]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[7]  E. Barillot,et al.  Theoretical analysis of library screening using a N-dimensional pooling strategy. , 1991, Nucleic acids research.

[8]  Miklós Ruszinkó,et al.  On the Upper Bound of the Size of the R-Cover-Free Families , 1993, Proceedings. IEEE International Symposium on Information Theory.

[9]  D. Balding,et al.  Efficient pooling designs for library screening. , 1994, Genomics.

[10]  Emanuel Knill,et al.  A Comparative Survey of Non-Adaptive Pooling Designs , 1996 .

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

[12]  Frank R. Kschischang,et al.  A simple taboo-based soft-decision decoding algorithm for expander codes , 1998, IEEE Communications Letters.

[13]  Donald L. Kreher,et al.  Pooling, lattice square, and union jack designs , 1999 .

[14]  A. Macula.  Probabilistic nonadaptive group testing in the presence of errors and DNA library screening , 1999 .

[15]  Noga Alon,et al.  Locally Thin Set Families , 2000, Comb. Probab. Comput..

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

[17]  International Human Genome Sequencing Consortium.  Initial sequencing and analysis of the human genome , 2001, Nature.

[18]  R. Gibbs,et al.  A clone-array pooled shotgun strategy for sequencing large genomes. , 2001, Genome research.

[19]  Zoltán Füredi,et al.  On the Maximum Size of (p, Q) - free Families , 2001, Electron. Notes Discret. Math..

[20]  Noga Alon,et al.  An optimal procedure for gap closing in whole genome shotgun sequencing , 2001, RECOMB.

[21]  J. V. Moran,et al.  Initial sequencing and analysis of the human genome. , 2001, Nature.

[22]  E. Green.  Strategies for the systematic sequencing of complex genomes , 2001, Nature Reviews Genetics.

[23]  Charles J. Colbourn,et al.  Construction of optimal quality control for oligo arrays , 2002, Bioinform..

[24]  Aleksandar Milosavljevic,et al.  Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design , 2002, WABI.

[25]  Ding-Zhu Du,et al.  New constructions of non-adaptive and error-tolerance pooling designs , 2002, Discret. Math..

[26]  Amir H. Banihashemi,et al.  Bootstrap decoding of low-density parity-check codes , 2002, IEEE Communications Letters.

[27]  Zhenyu Liu,et al.  Low complexity decoding of finite geometry LDPC codes , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[28]  Aleksandar Milosavljevic,et al.  Pooled Genomic Indexing (PGI): Analysis and Design of Experiments , 2004, J. Comput. Biol..

[29]  Marc P. C. Fossorier,et al.  A modified weighted bit-flipping decoding of low-density Parity-check codes , 2004, IEEE Communications Letters.

[30]  Zolre N Fünnoi.  Note on R-cover-free Families , .