[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Steiner systems for two-stage disjunctive testing

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

The subject of this paper are some constructions of Steiner designs with blocks of two sizes that differ by one. The study of such designs is motivated by a combinatorial lower bound on the minimum number of individual tests at the second stage of a 2-stage disjunctive testing algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Baker RD (1976) Partitioning the planes of AG 2m (2) into 2-designs. Discrete Math 15:205–211

    Article  MATH  MathSciNet  Google Scholar 

  • Beth T, Jungnickel D, Lenz H (1999) Design theory, 2nd edn. Cambridge University Press, Cambridge

    Google Scholar 

  • Colbourn CJ, Dinitz JF (eds) (1996) The CRC handbook of combinatorial designs. CRC, Boca Raton

    MATH  Google Scholar 

  • Du D-Z, Hwang FK (1993) Combinatorial group testing and its applications. World Scientific, Singapore

    MATH  Google Scholar 

  • Levenshtein VI (2003) A universal bound for a covering in regular posets and its application to pool testing. Discret Math 266:293–309

    Article  MATH  MathSciNet  Google Scholar 

  • Semakov NV, Zinoviev VA, Zaitsev GV (1973) Interrelation of preparata and Hamming codes and extension of Hamming codes to new double-error-correcting codes. In: Proceedings of the 2nd international symposium on information theory, pp 257–263, Tsakhadsor, Armenia, 1971. Academiai Kiado, Budapest

    Google Scholar 

  • Teirlinck L (1994) Some new 2-resolvable Steiner quadruple systems. Des Codes Cryptogr 4:5–10

    Article  MATH  MathSciNet  Google Scholar 

  • Tonchev VD (2003) A formula for the number of Steiner quadruple systems on 2n points of 2-rank 2nn. J Comb Des 11:260–274

    Article  MATH  MathSciNet  Google Scholar 

  • Tonchev VD (1996) A class of Steiner 4-wise balanced designs derived from Preparata codes. J Comb Des 3:203–204

    Article  MathSciNet  Google Scholar 

  • Wilson RM (1972a) An existence theory for pairwise balanced designs, part I. J Comb Theory Ser A 13:222–245

    Google Scholar 

  • Wilson RM (1972b) An existence theory for pairwise balanced designs, part II. J Comb Theory Ser A 13:246–273

    Article  MATH  Google Scholar 

  • Wilson RM (1975) An existence theory for pairwise balanced designs, part III. J Comb Theory Ser A 18:71–79

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vladimir D. Tonchev.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tonchev, V.D. Steiner systems for two-stage disjunctive testing. J Comb Optim 15, 1–6 (2008). https://doi.org/10.1007/s10878-007-9079-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-007-9079-z

Keywords

Navigation