Pooling spaces associated with finite geometry
From MaRDI portal
Publication:932830
DOI10.1016/j.ejc.2007.06.017zbMath1195.92075OpenAlexW2072584792MaRDI QIDQ932830
Tayuan Huang, Kaishun Wang, Chih-Wen Weng
Publication date: 11 July 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2007.06.017
Finite affine and projective planes (geometric aspects) (51E15) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (9)
Pooling semilattices and non-adaptive pooling designs ⋮ DNA library screening, pooling design and unitary spaces ⋮ A generalization of Macula's disjunct matrices ⋮ A generalization of the formulas for intersection numbers of dual polar association schemes and their applications ⋮ Error-correcting pooling designs associated with some distance-regular graphs ⋮ A construction of pooling designs with surprisingly high degree of error correction ⋮ A class of error-correcting pooling designs over complexes ⋮ Uniform posets and Leonard pairs based on unitary spaces over finite fields ⋮ Group testing with geometry of classical groups over finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(D\)-bounded distance-regular graphs
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Error-correcting pooling designs associated with some distance-regular graphs
- A class of error-correcting pooling designs over complexes
- A simple construction of \(d\)-disjunct matrices with certain constant weights
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
- Generalized cover-free families.
- A note on decoding of superimposed codes
- Pooling spaces and non-adaptive pooling designs
- Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs
- Nonrandom binary superimposed codes
- On the geometricity of lattices generated by orbits of subspaces under finite classical groups
- New constructions of non-adaptive and error-tolerance pooling designs
This page was built for publication: Pooling spaces associated with finite geometry
