2 research outputs found
Efficient Two-Stage Group Testing Algorithms for Genetic Screening
Efficient two-stage group testing algorithms that are particularly suited for
rapid and less-expensive DNA library screening and other large scale biological
group testing efforts are investigated in this paper. The main focus is on
novel combinatorial constructions in order to minimize the number of individual
tests at the second stage of a two-stage disjunctive testing procedure.
Building on recent work by Levenshtein (2003) and Tonchev (2008), several new
infinite classes of such combinatorial designs are presented.Comment: 14 pages; to appear in "Algorithmica". Part of this work has been
presented at the ICALP 2011 Group Testing Workshop; arXiv:1106.368
New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes
This paper presents several new construction techniques for low-density
parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on
specific classes of combinatorial designs, the improved code design focuses on
high-rate structured codes with constant column weights 3 and higher. The
proposed codes are efficiently encodable and exhibit good structural
properties. Experimental results on decoding performance with the sum-product
algorithm show that the novel codes offer substantial practical application
potential, for instance, in high-speed applications in magnetic recording and
optical communications channels.Comment: 10 pages; to appear in "IEEE Transactions on Communications