Superimposed codes are almost big distance ones

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1997, Pages 118-

  Furedi, Zoltán ^a   Ruszinko, Miklós ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b Comp And Aut Res Inst Hung Ac Sci Budapest ^*  (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; INFORMATION THEORY; SET THEORY; THEOREM PROVING;

SUPERIMPOSED CODES;

CODES (SYMBOLS);

EID: 0030691333     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1997.613033     Document Type: Conference Paper

References (12)

1. A. G. Dyachkov and V.V. Rykov, "Bounds on the length of disjunctive codes", Problemy Peredachi Informatsii, vol. 18, No
2. P. Erdas, P. Frankl and Z. Furedi, "Families of finite sets in which no set is covered by the union of two others", Journal of Cotnbtnatord Theory, Sertes A, vol. 33, No. 2, 158-166, 1982.
3. P. ErdGs, P. Frankl and Z, Fiiredi, "Families of finite sets in which no set is covered by the union of r others", Israel J. of Math., vol. 51. Nos. 1-2, 79-89, 1985.
4. L. GyBd and J.L. Massey, "Constructions of binary constant-weight cyclic codes and cyclically permutable codes", IEEE Trans. On Znf. Th., vol. 38, No 3, pp. 940-949, 1992.
5. F. K. Hwang, "A method for detecting all defective members in a population by group testing", J. of the American Statistical Association, vol. 67, No 339, 605-608, 1972.
6. F. K. Hwang ",N on adaptive hypergeometric group testing", Studio Sc. Math. Hungarica, vol. 22, 257-263, 1987.
7. S. M. Johnson, "On the upper bounds for unrestricted binary error-correctingcodes", IEEE Trans. On In. Th., vol. 17, No.
8. S. M. Johnson, "Improved asymptotic bounds for errorcorrecting codes", IEEE Trans. On Inf. Th., vol. 9, No 4, 198-205, 1963.
9. W. H. Kautz and R.C. Singleton, Nonrandom binary superimposed codes, IEEE Trans. On Inf. Th., vol. 10, 363-377, 1964. 3, 7-13, 1982.
10. J. Kiirner, pcrsonal communication.
11. V. Rodl, "On a packing and covering problem", Europ. J. Combinatorics, vol. 5, 69-78, 1985.
12. M. Ruszink, "On the upper bound of the size of the r-coverfree families", Journal of Combinatorial Theory, Series A, vol. 66, F!o. 2, 302-310, 1994.