S. C. Chang and E. J. Weldon, Coding for T-user multiple-access channels, IEEE Transactions on Information Theory, vol.25, issue.6, pp.684-691, 1979.
DOI : 10.1109/TIT.1979.1056109

N. H. Bshouty and H. Mazzawi, Algorithms for the Coin Weighing Problem with the Presence of Noise, Electronic Colloquim on Computational Complexity, p.124, 2011.

P. Erdos and A. Renyi, On two problems of information theory, Publ.Math. Inst. Hung. Acad.Sci, issue.8, pp.241-254, 1963.

B. Lindstrom, On a combinatorial detection problem,I, Publ.Math. Inst. Hung. Acad.Sci, issue.9, pp.195-207, 1964.

D. Cantor and W. Mills, Determining a subset from a certain combinatorial properties, Canadian J. Math, issue.18, pp.42-48, 1966.

B. Lindstrom, On B2-sequences of vectors, Journal of Number Theory, vol.4, issue.3, pp.261-265, 1972.
DOI : 10.1016/0022-314X(72)90052-2

G. Cohen, S. Litsyn, and G. Zemor, Binary B2-Sequences : A New Upper Bound, Journal of Combinatorial Theory, Series A, vol.94, issue.1, pp.152-155, 2001.
DOI : 10.1006/jcta.2000.3127

L. Gargano, V. Montuori, G. Setaro, and U. Vaccaro, An improved algorithm for quantative group testing, Discrete Applied Mathematics, issue.36, pp.299-306, 1992.

A. A. Dyachkov and V. V. Rykov, On a coding model for a multiple-access adder channel, Problems of Information Transmission, vol.17, issue.2, pp.94-104, 1981.

G. S. Poltyrev, Improved upper bound on the probability of decoding error for codes of complex structure, Problems of Information Transmission, pp.251-262, 1987.

M. Malyutov, Search for Sparse Active Inputs: A Review, Information Theory, Combinatorics and Search Theory, pp.609-647, 2014.
DOI : 10.1109/18.2636

D. L. Donoho, Compressed sensing, IEEE Transactions on Information Theory, vol.52, issue.4, pp.1289-1306, 2006.
DOI : 10.1109/TIT.2006.871582
URL : https://hal.archives-ouvertes.fr/inria-00369486

E. J. Candes and T. Tao, Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?, IEEE Transactions on Information Theory, vol.52, issue.12, pp.5406-5425, 2006.
DOI : 10.1109/TIT.2006.885507

C. L. Chan, S. Jaggi, V. Saligrama, and S. Agnihotri, Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms, IEEE Transactions on Information Theory, vol.60, issue.5, pp.3019-3035, 2014.
DOI : 10.1109/TIT.2014.2310477

S. Lu, J. Cheng, W. Hou, and Y. Watanabe, Generalized construction of signature code for multiple-access adder channel, 2013 IEEE International Symposium on Information Theory, pp.1655-1659, 2013.
DOI : 10.1109/ISIT.2013.6620508

G. Kabatiansky and S. Vladuts, What to do if syndromes are corrupte also, Proc. Int.Workshop Optimal Codes, 2013.

G. Kabatiansky, V. Lomakov, and S. Vladuts, On error-correction under distortions in channel and syndrom, Problems of Information Transmission, p.2015

F. J. Macwilliams and N. J. Sloane, The Theory of Error-Correcting Codes

S. Yekhanin and I. Dumer, Long Nonbinary Codes Exceeding the Gilbert???Varshamov Bound for any FixedDistance, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2357-2362, 2004.
DOI : 10.1109/TIT.2004.834744