Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Threshold Saturation for Quantitative Group Testing with Low-Density Parity-Check Codes

Mashauri, Mgeni Makambi LU ; Graell i Amat, Alexandre and Lentmaier, Michael LU (2024) 2024 IEEE International Symposium on Information Theory, ISIT 2024 p.3011-3016
Abstract

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. Even larger gains were numerically observed in combination with spatial coupling. In this paper, we use vector admissible systems to prove threshold saturation and compute the corresponding potential thresholds.

Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings
pages
6 pages
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
2024 IEEE International Symposium on Information Theory, ISIT 2024
conference location
Athens, Greece
conference dates
2024-07-07 - 2024-07-12
external identifiers
  • scopus:85202894456
ISBN
9798350382846
DOI
10.1109/ISIT57864.2024.10619188
language
English
LU publication?
yes
id
c6f99fcd-330e-47c3-b0c8-9b8711a9f44c
date added to LUP
2024-12-16 10:41:36
date last changed
2025-06-02 23:31:23
@inproceedings{c6f99fcd-330e-47c3-b0c8-9b8711a9f44c,
  abstract     = {{<p>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. Even larger gains were numerically observed in combination with spatial coupling. In this paper, we use vector admissible systems to prove threshold saturation and compute the corresponding potential thresholds.</p>}},
  author       = {{Mashauri, Mgeni Makambi and Graell i Amat, Alexandre and Lentmaier, Michael}},
  booktitle    = {{2024 IEEE International Symposium on Information Theory, ISIT 2024 - Proceedings}},
  isbn         = {{9798350382846}},
  language     = {{eng}},
  pages        = {{3011--3016}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{Threshold Saturation for Quantitative Group Testing with Low-Density Parity-Check Codes}},
  url          = {{http://dx.doi.org/10.1109/ISIT57864.2024.10619188}},
  doi          = {{10.1109/ISIT57864.2024.10619188}},
  year         = {{2024}},
}