18 citations · 62 across the 17 of their papers we have counts for
6 papers · 1 filter
Access Balancing in Storage Systems by Labeling Partial Steiner Systems
Yeow Meng Chee, Charles J. Colbourn, Hoang Dau +4
Storage architectures ranging from minimum bandwidth regenerating encoded distributed storage systems to declustered-parity RAIDs can be designed using dense partial Steiner system…
Set-Codes with Small Intersections and Small Discrepancies
R. Gabrys, H. S. Dau, C. J. Colbourn +1
We are concerned with the problem of designing large families of subsets over a common labeled ground set that have small pairwise intersections and the property that the maximum d…
A combinatorial approach to X-tolerant compaction circuits
Yuichiro Fujiwara, Charles J. Colbourn
Test response compaction for integrated circuits (ICs) with scan-based design-for-testability (DFT) support in the presence of unknown logic values (Xs) is investigated from a comb…
Compressed sensing with combinatorial designs: theory and simulations
Darryn Bryant, Charles Colbourn, Daniel Horsley +1
In 'An asymptotic result on compressed sensing matrices', a new construction for compressed sensing matrices using combinatorial design theory was introduced. In this paper, we use…
Hierarchical Recovery in Compressive Sensing
Charles J. Colbourn, Daniel Horsley, Violet R. Syrotiuk
A combinatorial approach to compressive sensing based on a deterministic column replacement technique is proposed. Informally, it takes as input a pattern matrix and ingredient mea…
Constructions for Difference Triangle Sets
Yeow Meng Chee, Charles J. Colbourn
Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for difference…