activity
20122022
most citedDecompositions of complete graphs into cycles of arbitrary lengths

54 citations · 108 across the 24 of their papers we have counts for

collaborators
Showing 2015 · cs.ITShow all

1 paper · 2 filters

cs.IT2015

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…