Two new error-correcting pooling designs from d-bounded distance-regular graphs

DOI10.1007/S10878-007-9115-ZzbMATH Open1218.05030OpenAlexW2125805610MaRDI QIDQ732327FDOQ732327

Authors: Xinlu Zhang, Jun Guo, Suogang Gao 

Publication date: 9 October 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9115-z

Recommendations

• Error-correcting pooling designs associated with some distance-regular graphs
• A class of error-correcting pooling designs over complexes
• Error-tolerance pooling designs based on Johnson graphs
• A construction of pooling designs with surprisingly high degree of error correction
• Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2
• New construction of error-correcting pooling designs from singular linear spaces over finite fields
• New error-correcting pooling designs associated with finite vector spaces
• scientific article; zbMATH DE number 6288915
• Two error-correcting pooling designs from symplectic spaces over a finite field
• New error-correcting pooling designs with vector spaces over finite field

zbMATH Keywords

distance-regular graphpooling designsstrongly closed subgraphs\(s^e\)-disjunct matrix

Mathematics Subject Classification ID

Applications of graph theory (05C90) Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Classical distance-regular graphs of negative type
• A simple construction of \(d\)-disjunct matrices with certain constant weights
• \(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
• Weak-geodetically closed subgraphs in distance-regular graphs
• On strongly closed subgraphs of highly regular graphs

Cited In (3)

• Pooling semilattices and non-adaptive pooling designs
• Error-correcting pooling designs associated with some distance-regular graphs
• Constructing error-correcting pooling designs with symplectic space

This page was built for publication: Two new error-correcting pooling designs from \(d\)-bounded distance-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732327)