View in EDS

LDPC Codes for Quantitative Group Testing With a Non-Binary Alphabet

Saved in:
Bibliographic Details
Title: LDPC Codes for Quantitative Group Testing With a Non-Binary Alphabet
Authors: Mashauri, Mgeni Makambi, i Amat, Alexandre Graell, Lentmaier, Michael
Contributors: Lund University, Faculty of Engineering, LTH, LTH Profile areas, LTH Profile Area: AI and Digitalization, Lunds universitet, Lunds Tekniska Högskola, LTH profilområden, LTH profilområde: AI och digitalisering, Originator, Lund University, Profile areas and other strong research environments, Strategic research areas (SRA), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Lunds universitet, Profilområden och andra starka forskningsmiljöer, Strategiska forskningsområden (SFO), ELLIIT: the Linköping-Lund initiative on IT and mobile communication, Originator
Source: IEEE Communications Letters. 29(3):630-634
Subject Terms: Engineering and Technology, Electrical Engineering, Electronic Engineering, Information Engineering, Telecommunications, Teknik, Elektroteknik och elektronik, Telekommunikation
Description: We propose and analyze a novel scheme based on LDPC codes for quantitative group testing. The key underlying idea is to augment the bipartite graph by introducing hidden non-binary variables to strengthen the message-passing decoder. This is achieved by grouping items into bundles of size q within the test matrix, while keeping the testing procedure unaffected. The decoder, inspired by some works on counter braids, passes lower and upper bounds on the bundle values along the edges of the graph, with the gap between the two shrinking with the decoder iterations. Through a density evolution (DE) analysis and finite length simulations, we show that the proposed scheme significantly outperforms its binary counterpart with limited increase in complexity.
Access URL: https://doi.org/10.1109/LCOMM.2025.3538910
Database: SwePub
Description
Abstract:We propose and analyze a novel scheme based on LDPC codes for quantitative group testing. The key underlying idea is to augment the bipartite graph by introducing hidden non-binary variables to strengthen the message-passing decoder. This is achieved by grouping items into bundles of size q within the test matrix, while keeping the testing procedure unaffected. The decoder, inspired by some works on counter braids, passes lower and upper bounds on the bundle values along the edges of the graph, with the gap between the two shrinking with the decoder iterations. Through a density evolution (DE) analysis and finite length simulations, we show that the proposed scheme significantly outperforms its binary counterpart with limited increase in complexity.
ISSN:10897798
DOI:10.1109/LCOMM.2025.3538910