An improved upper bound of the rate of euclidean superimposed codes

IEEE Transactions on Information Theory

Volumn 45, Issue 2, 1999, Pages 799-802

  Füredi, Zoltán ^a   Ruszinkó, Miklos ^a  

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

Author keywords

Codes; Growth rate; Superimposed geometric codes

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; THEOREM PROVING; VECTORS;

EUCLIDEAN SUPERIMPOSED CODES;

BINARY CODES;

EID: 0033100280     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.749032     Document Type: Article

References (22)

1. Q.A. Nguyen and T. Zeisel, "Bounds on constant weight binary superimposed codes," Prob. Contr. Inform. Theory, vol. 17, pp. 223-230, 1988.
2. P.-O. Anderson, "Superimposed codes for the Euclidean channel," Ph.D. dissertation, Linköping Studies in Science and Technology, Linköping, Sweden.
3. "A construction of superimposed codes for the Euclidean channel," in P roc. 1994 IEEE Int. Symp. Inform. Theory, Trondheim, Norway, June 27-July 1, 1994, p. 283.
4. A.G. Dyachkov and V. V. Rykov, "Bounds on the length of disjunctive codes," Problemy Peredaci Informacii, vol. 18, no. 3, pp. 7-13, 1982.
5. "A survey of superimposed codes theory," Prob. Contr. Inform. Theory, vol. 12, no. 4, pp. 1-13, 1983.
6. P. Erdös, P. Frankl, and Z. Füredi, "Families of finite sets in which no set is covered by the union of two others," J. Comb. Theory, Series A, vol. 33, no. 2, pp. 158-166, 1982.
7. "Families of finite sets in which no set is covered by the union of r others," Israel J. Math., vol. 51, no. 1/2, pp. 79-89, 1985.
8. T. Ericson and L. Györfi, "Superimposed codes in A"," IEEE Trans. Inform. Theory, vol. 34, pp. 877-880, July 1988.
9. Z. Füredi, "A note on r-cover-free families," J. Comb. Theory, Series A, vol. 73, pp. 172-173, 1996.
10. Z. Füredi and M. Ruszinkö, "Superimposed codes are almost big distance ones," in Proc. 1997 IEEE Int. Symp. Inform. Theory, Ulm, Germany, June 29-July 4, 1997, p. 118.
11. F.K. Hwang, "A method for detecting all defective members in a population by group testing," J. Amer. Stat. Assoc., vol. 67, no. 339, pp. 605-608, 1972.
12. F.K. Hwang and V. T. Sos, "Non adaptive hypergeometric group testing," Studio Sei. Math. Hangar., vol. 22, pp. 257-263, 1987.
13. F. John, "Extremum problems with inequalities as subsidiary conditions," in Studies and Essays Presented to R. Courant on his 60th Birthday, January 8, 1948. New York: Interscience, 1948, pp. 187-204.
14. S.M. Johnson, "On the upper bounds for unrestricted binary errorcorrecting codes," IEEE Trans. Inform. Theory, vol. IT-17, no. 4, pp. 466-478, 1971.
15. "Improved asymptotic bounds for error-correcting codes," IEEE Trans. Inform. Theory, vol. IT-9, no. 4, pp. 198-205, 1963.
16. "A new upper bound for error-correcting codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 203-207, 1962.
17. G.A. Kabatjanskil and V. I. Levenstein, "Bounds for packings on a sphere and in a space," (Russian) Problemy Peredaci Informacii, vol. 14, pp. 3-25, 1978.
18. W.H. Kautz, and R. C. Singleton, "Nonrandom binary superimposed codes," IEEE Trans. Inform. Theory, vol. IT-10, pp. 363-377, Oct. 1964.
19. V.D. Milman, "Almost Euclidean quotient spaces of subspaces of finite dimensional normed spaces," in Proc. Amer. Math. Soc., 1985, vol. 94, pp. 445-449.
20. G. Pisier, "The volume of convex bodies and Banach space geometry," Cambridge Tracts in Mathematics 9. Cambridge, U.K.: Cambridge, Univ. Press, 1989.
21. M. Ruszinkö, "On the upper bound of the size of the r-cover-free families," J. Comb. Theory, Series A, vol. 66, no. 2, pp. 302-310, May 1994.
22. V.T. Sos, "An additive problem in different structures," in Proc. 2nd Int. Conf. in Graph Theory, Combinatorics, Algorithms, and Applications, San Francisco Univ., San Francisco, CA, July 1989, pp. 486-510.