117 citations · 924 across the 105 of their papers we have counts for
52 papers · 1 filter
Finding a Burst of Positives via Nonadaptive Semiquantitative Group Testing
Yun-Han Li, Ryan Gabrys, Jin Sima +2
Motivated by testing for pathogenic diseases we consider a new nonadaptive group testing problem for which: (1) positives occur within a burst, capturing the fact that infected tes…
On Constant-Weight Binary -Sequences
Jin Sima, Yun-Han Li, Ilan Shomorony +1
Motivated by applications in polymer-based data storage we introduced the new problem of characterizing the code rate and designing constant-weight binary -sequences. Binary $…
Reconstruction of Sets of Strings from Prefix/Suffix Compositions
Ryan Gabrys, Srilakshmi Pattabiraman, Olgica Milenkovic
The problem of reconstructing strings from substring information has found many applications due to its importance in genomic data sequencing and DNA- and polymer-based data storag…
Semiquantitative Group Testing in at Most Two Rounds
Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic
Semiquantitative group testing (SQGT) is a pooling method in which the test outcomes represent bounded intervals for the number of defectives. Alternatively, it may be viewed as an…
Reconstructing Mixtures of Coded Strings from Prefix and Suffix Compositions
Ryan Gabrys, Srilakshmi Pattabiraman, Olgica Milenkovic
The problem of string reconstruction from substring information has found many applications due to its relevance in DNA- and polymer-based data storage. One practically important a…
Repairing Reed-Solomon Codes via Subspace Polynomials
Hoang Dau, Dinh Thi Xinh, Han Mao Kiah +2
We propose new repair schemes for Reed-Solomon codes that use subspace polynomials and hence generalize previous works in the literature that employ trace polynomials. The Reed-Sol…