New constructions of superimposed codes

IEEE Transactions on Information Theory

Volumn 46, Issue 1, 2000, Pages 284-290

  D'yachkov, Arkadii G ^a   Macula Jr , Anthony J ^b   Rykov, Vyacheslav V ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DATABASE SYSTEMS; ENCODING (SYMBOLS); ERROR CORRECTION; GRAPH THEORY; MATRIX ALGEBRA; SET THEORY;

BOOLEAN SUM; CLONE LIBRARY SCREENING; CODEWORDS; CONCATENATED CODES; REED-SOLOMON CODES; SUPERIMPOSED CODES;

BINARY CODES;

EID: 0033896794     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.817530     Document Type: Article

References (19)

1. W. H. Kautz and R. C. Singleton, "Nonrandom binary superimposed Codes," IEEE Trans. Inform. Theory, vol. IT-10, pp. 363-377, July 1964.
2. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North Holland, 1983.
3. A. G. D'yachkov, V. V. Rykov, and A. M. Rashad, "Superimposed distance codes," Probl. Contr. Inform. Theory, vol. 18, no. 4, pp. 237-250, 1989.
4. A. G. D'yachkov and V. V. Rykov, "Bounds on the length of disjunctive codes" (in Russian), Probl. Pered. Inform., vol. 18, no. 3, pp. 7-33, 1982.
5. _, "A survey of superimposed code theory," Probl. Contr. Inform. Theory, vol. 12, no. 4, pp. 229-242, 1983.
6. D.-Z. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications. Singapore, NJ/London/Hong Kong: World Scientific, 1993.
7. P. Erdos, F. Frankl, and F. Füredi, "Families of finite set in which no set is covered by the union of r others," Israel J. Math., vol. 51, no. 1-2, pp. 75-89, 1985.
8. N. Q. A and T. Zeisel, "Bounds on constant-weight binary superimposed codes," Probl. Contr. Inform. Theory, vol. 17, no. 4, pp. 223-230, 1988.
9. M. Ruszinko, "On the upper bound of the size of r-cover-free families," J. Comb. Theory, ser. A, vol. 66, pp. 302-310, 1994.
10. Z. Füredi, "A note on r-cover-free families," J. Comb. Theory, ser. A, vol. 73, pp. 172-173, 1996.
11. A. G. D'yachkov, A. J. Macula, and V. V. Rykov, "On optimal parameters of a class of superimposed codes and designs," in 1998 IEEE Int. Symp. Information Theory. Cambridge, MA, Aug. 16-21, 1998, p. 363.
12. E. Knill, W. J. Bruno, and D. C. Torney, "Non-Adaptive group testing in the presense of error," Discr. Appl. Math., vol. 88, pp. 261-290, 1998.
13. A. G. D'yachkov, A. J. Macula, and V. V. Rykov, "New applications and results of superimposed code theory arising from the potentialities of molecular biology," paper, submitted for publication.
14. A. G. D'yachkov and V. V. Rykov, "Optimal superimposed codes and designs for Renyi's search model," paper, submitted for publication.
15. V. A. Zinovjev, "Cascade equal-weight codes and maximal packing," Probl. Contr. Inform. Theory, vol. 12, no. 1, pp. 3-9, 1983.
16. 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, pp. 940-949, 1992.
17. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, "A new table of constant-weight codes," IEEE Trans. Inform. Theory, vol. 36, pp. 1334-1380, Nov. 1990.
18. E. M. Rains and N. J. A. Sloane, "Table of constant weight binary codes," [Online], available at http://www.research.att.com/~njas/codes/Andw/index.html.
19. R. S. Singleton, "Maximum distance Q-nary codes," IEEE Trans. Inform. Theory, vol. IT-10, pp. 116-118, Mar. 1964.