Advertisement

Problems of Information Transmission

, Volume 41, Issue 3, pp 199–203 | Cite as

A Note on the Uniqueness of (w, r) Cover-Free Codes

  • V. S. Lebedev
Coding Theory
  • 31 Downloads

Abstract

A binary code is called a (w, r) cover-free code if it is the incidence matrix of a family of sets where the intersection of any w sets is not covered by the union of any other r sets. For certain (w, r) cover-free codes with a simple structure, we obtain a new condition of optimality and uniqueness up to row and/or column permutations.

Keywords

System Theory Simple Structure Binary Code Incidence Matrix Column Permutation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. 1.
    Mitchell, C.J. and Piper, F.C., Key Storage in Secure Networks, Discrete Appl. Math., 1988, vol. 21, pp. 215–228.CrossRefGoogle Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Kim, H.K. and Lebedev, V.S., On Optimal Superimposed Codes, J. Combin. Des., 2004, vol. 12, no.2, pp. 79–91.CrossRefGoogle Scholar
  6. 6.
    Kim, H.K. and Lebedev, V.S., Uniqueness of Some Optimal Superimposed Codes, in Proc. 9th Int. Workshop on Algebraic and Combinatorial Coding Theory, Kranevo, Bulgaria, 2004, pp. 241–246.Google Scholar
  7. 7.
    Kapralov, S., On the (2, 2) Superimposed Codes of Length 18, in Proc. 9th Int. Workshop on Algebraic and Combinatorial Coding Theory, Kranevo, Bulgaria, 2004, pp. 236–240.Google Scholar
  8. 8.
    Hong, S., Kapralov, S.N., Kim, H.K., and Oh, D.Y., Uniqueness of Some Optimal Superimposed Codes, J. Combin. Des., submitted.Google Scholar
  9. 9.
    Engel, K., Interval Packing and Covering in the Boolean Lattice, Combin. Probab. Comput., 1996, vol. 5, pp. 373–384.Google Scholar
  10. 10.
    Kim, H.K. and Lebedev, V.S., On the Optimality of Trivial (w, r)-Cover-Free Codes, Probl. Peredachi Inf., 2004, vol. 40, no.3, pp. 13–20 [Probl. Inf. Trans. (Engl. Transl.), 2004, vol. 40, no. 3, pp. 195–201].Google Scholar
  11. 11.
    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].Google Scholar
  12. 12.
    Erdos, 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.Google Scholar
  13. 13.
    Huang, S.H. and Hwang, F.K., When Is Individual Testing Optimal for Nonadaptive Group Testing?, SIAM J. Discrete Math., 2001, vol. 14, no.4, pp. 540–548.CrossRefGoogle Scholar
  14. 14.
    Lebedev, V.S., Asymptotic Upper Bound for the Rate of (w, r) Cover-Free Codes, Probl. Peredachi Inf., 2003, vol. 39, no.4, pp. 3–9 [Probl. Inf. Trans. (Engl. Transl.), 2003, vol. 39, no. 4, pp. 317–323].Google Scholar

Copyright information

© MAIK "Nauka/Interperiodica" 2005

Authors and Affiliations

  • V. S. Lebedev
    • 1
  1. 1.Institute for Information Transmission ProblemsMoscowRussia

Personalised recommendations