Two error-correcting pooling designs from symplectic spaces over a finite field

Group testing with geometry of classical groups over finite fields

“…In 2010, Li et al [16] constructed two family pooling designs based on the symplectic space. where N (m 1 , r ; m, r ; 2ν) is from (4).…”

“…14[16] For 2r≤ d 0 < d < k ≤ ν + r, assume that P 0 is a fixed (d 0 , r )-space of F (2ν) q . Let M be a binary matrix whose columns (rows) indexed by all (k, r )-spaces containing P 0 ((d, r )-spaces containing P 0 ) in F (2ν) q such that M(A, B) = 1 if A ⊆ B and 0 otherwise.…”