Efficient Error-Correcting Pooling Designs Constructed from Pseudo-Symplectic Spaces Over a Finite Field

Abstract

Abstract

In this article, we construct two classes of t × n, s^e-disjunct matrix with subspaces in pseudo-symplectic space \documentclass{aastex}\usepackage{amsbsy}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{bm}\usepackage{mathrsfs}\usepackage{pifont}\usepackage{stmaryrd}\usepackage{textcomp}\usepackage{portland, xspace}\usepackage{amsmath, amsxtra}\pagestyle{empty}\DeclareMathSizes{10}{9}{7}{6}\begin{document}\begin{align*}\bf {\mathbb F}_q^{(2 \nu + 1)}\end{align*}\end{document} of characteristic 2 and prove that the test efficiency t/n of these constructions are smaller than that of D'yachkov et al. (2005).