Abstract
A (w, r)-cover-free code is the incidence matrix of a family of sets where no intersection of w members of the family is covered by the union of r others. We obtain a new condition in view of which (w, r)-cover-free codes with a simple structure are optimal. We also introduce (w, r)-cover-free codes with a constraint set.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
D'yachkov, A., Macula, A., Torney, V., and Vilenkin, P., Families of Finite Sets in Which No Intersection of ` Sets Is Covered by the Union of s Others, J. Combin. Theory, Ser. A, 2002, vol. 99, pp. 195–218.
D'yachkov, A., Macula, A., Torney, V., Vilenkin, P., and Yekhanin, S., New Results in the Theory of Superimposed Codes, in Proc. 7th Int. Workshop on Algebraic and Combinatorial Coding Theory, Bansko, Bulgaria, 2000, pp. 126–136.
Kim, H.K., Lebedev, V.S., and Oh, D.Y., Some New Results on Superimposed Codes, J. Combin. Des., to appear.
Kautz, W.H. and Singleton, R.C., Nonrandom Binary Superimposed Codes, IEEE Trans. Inf. Theory, 1964, vol. 10, no. 3, pp. 363–377.
Mitchell, C.J. and Piper, F.C., Key Storage in Secure Networks, Discr. Appl. Math., 1988, vol. 21, pp. 215–228.
Sagalovich, Yu.L., Separaring Systems, Probl. Peredachi Inf., 1994, vol. 30, no. 2, pp. 14–35 [Probl. Inf. Trans. (Engl. Transl.), 1994, vol. 30, no. 2, pp. 105-123].
van Lint, J.H. and Wilson, R.M., A Course in Combinatorics, Cambridge: Cambridge Univ. Press, 1992.
Kim, H.K. and Lebedev, V.S., On Optimal Superimposed Codes, J. Combin. Des., 2004, vol. 12, no. 2, pp. 79–91.
Engel, K., Interval Packing and Covering in the Boolean Lattice, Combin. Probab. Comput., 1996, vol. 5, pp. 373–384.
Stinson, D.R., Wei, R., and Zhu, L., Some New Bounds for Cover-Free Families, J. Combin. Theory, Ser. A, 2000, vol. 90, pp. 224–234.
D'yachkov, A.G. and Rykov, V.V., Bounds on the Length of Disjunctive Codes, Probl. Peredachi Inf., 1982, vol. 18, no. 3, pp. 7–13 [Probl. Inf. Trans. (Engl. Transl.), 1982, vol. 18, no. 3, pp. 166-171].
Erd~ os, P., Frankl, F., and Furedi, F., Families of Finite Sets in Which No Set Is Covered by the Union of r Others, Israel J. Math., 1985, vol. 51, no. 1-2, pp. 75–89.
Lebedev, V.S., Asymptotic Upper Bound for the Rate of (w; r) Cover-Free Codes, Probl. Peredachi Inf., 2003, vol. 39, no. 4, pp. 75–89 [Probl. Inf. Trans. (Engl. Transl.), 2003, vol. 39, no. 4, pp. 317-323].
Stinson, D.R., Wei, R., and Zhu, L., New Constructions for Perfect Hash Families and Related Structures Using Combinatorial Designs and Codes, J. Combin. Des., 2000, vol. 8, pp. 189–200.
Kwon, Y.S., private communication, April 2002.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kim, H.K., Lebedev, V.S. On the Optimality of Trivial (w, r)-Cover-Free Codes. Problems of Information Transmission 40, 195–201 (2004). https://doi.org/10.1023/B:PRIT.0000044255.42299.4f
Issue Date:
DOI: https://doi.org/10.1023/B:PRIT.0000044255.42299.4f