Threshold Saturation for Quantitative Group Testing with Low-Density Parity-Check Codes
We recently proposed a quantitative group testing (GT) scheme with low-complexity peeling decoding based on low-density parity-check (LDPC) codes. Based on finite length simulations and a density evolution analysis we were able to demonstrate that simple (dv,dc)-regular LDPC codes can be more efficient for GT than existing generalized LDPC (GLDPC) code constructions based on BCH component codes. E
