Pooling spaces associated with finite geometry
DOI10.1016/J.EJC.2007.06.017zbMATH Open1195.92075OpenAlexW2072584792MaRDI QIDQ932830FDOQ932830
Authors: 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
Recommendations
Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Finite affine and projective planes (geometric aspects) (51E15)
Cites Work
- Title not available (Why is that?)
- Nonrandom binary superimposed codes
- Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Title not available (Why is that?)
- A simple construction of \(d\)-disjunct matrices with certain constant weights
- Generalized cover-free families.
- \(D\)-bounded distance-regular graphs
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
- Pooling spaces and non-adaptive pooling designs
- Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs
- New constructions of non-adaptive and error-tolerance pooling designs
- Error-correcting pooling designs associated with some distance-regular graphs
- On the geometricity of lattices generated by orbits of subspaces under finite classical groups
- A class of error-correcting pooling designs over complexes
- A note on decoding of superimposed codes
Cited In (10)
- Pooling semilattices and non-adaptive pooling designs
- A generalization of Macula's disjunct matrices
- A construction of pooling designs with surprisingly high degree of error correction
- Error-correcting pooling designs associated with some distance-regular graphs
- More on pooling spaces
- DNA library screening, pooling design and unitary spaces
- A generalization of the formulas for intersection numbers of dual polar association schemes and their applications
- 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
This page was built for publication: Pooling spaces associated with finite geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932830)