Skip to main content
Log in

The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design

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

Abstract

In this paper, we construct a d z-disjunct matrix with the orthogonal spaces over finite fields of odd characteristic. We consider the arrangement problem of d (m−1,2(s−1),s−1)-subspaces and the tighter bounds for an error-tolerant pooling design. Moreover, we give the tighter analysis of our construction by the results of the arrangement problem. Additionally, by comparing our construction with the previous construction out of vector spaces, we find that our construction is better under some conditions.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Du D-Z, Hwang FK (2006) Pooling designs and nonadaptive group testing. World Scientific, Singapore

    Book  MATH  Google Scholar 

  • D’yachkov AG, Hwang FK, Macula AJ, Vilenkin PA, Weng C-W (2005) A construction of pooling designs with some happy surprises. J Comput Biol 12:1129–1136

    Article  Google Scholar 

  • D’yachkov AG, Macula AJ, Vilenkin PA (2007) Nonadaptive and trivial two-stage group testing with error-correcting d e-disjunct inclusion matrices. In: Boylai society mathematical studies, vol 16. Springer, Berlin, pp 71–83

    Google Scholar 

  • Fu H-L, Hwang FK (2006) A novel use of t-packings to construct d-disjunct matrices. Discrete Appl Math 154:1759–1762

    Article  MATH  MathSciNet  Google Scholar 

  • Huang T, Weng C-W (2004) Pooling spaces and non-adaptive pooling designs. Discrete Math 282(1–3):163–169

    Article  MATH  MathSciNet  Google Scholar 

  • Macula AJ, Rykov VV, Yekhanin S (2004) Trivial two-stage group testing for complexes using almost disjunct matrice. Discrete Appl Math 137:97–107

    Article  MATH  MathSciNet  Google Scholar 

  • Ngo HQ (2008) On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design. J Comb Optim 15:61–76

    Article  MATH  MathSciNet  Google Scholar 

  • Ngo HQ, Du D-Z (2002) New constructions of non-adaptive and error-tolerance pooling designs. Discrete Math 243:161–170

    Article  MATH  MathSciNet  Google Scholar 

  • Wan Z-X (2002) Geometry of classical groups over finite fields, 2nd edn. Science Press, Beijing

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Geng-Sheng Zhang.

Additional information

Supported by NSF of the Education Department of Hebei Province (2007127) and NSF of Hebei Normal University (L2004B04).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, GS., Yang, YQ. The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design. J Comb Optim 20, 142–160 (2010). https://doi.org/10.1007/s10878-008-9199-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-008-9199-0

Keywords

Navigation