activity
20082026
most citedCoded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access

356 citations · 1.4k across the 78 of their papers we have counts for

collaborators
Showing cs.ITShow all

84 papers · 1 filter

cs.IT2026

Polar and Convolutional Codes for the Unequal Message Protection Problem

Alexander Sauter, Riccardo Schiavone, Lucía Balsa Picado +1

This paper proposes the design of polar and convolutional coset codes for the unequal message protection (UMP) in the short blocklength regime, to overcome the rate loss introduced…

cs.IT2025

Fully Asynchronous Unsourced Random Access over Fading Channels

Mert Ozates, Mohammad Kazemi, Gianluigi Liva +1

We examine unsourced random access in a fully asynchronous setup, where active users transmit their data without restriction on the start time over a fading channel. In the propose…

cs.IT2025★ 1 cited

Rate-Adaptive Protograph-Based MacKay-Neal Codes

Ayman Zahr, Emna Ben Yacoub, Balázs Matuz +1

Rate-adaptive MacKay-Neal (MN) codes based on protographs are analyzed. The code construction employs an outer distribution matcher (DM) to adapt the rate of the scheme. The DM is…

cs.IT2025

Rate-Adaptive Spatially Coupled MacKay-Neal Codes with Thresholds Close to Capacity

Ayman Zahr, Gianluigi Liva

We analyze by density evolution the asymptotic performance of rate-adaptive MacKay-Neal (MN) code ensembles, where the inner code is a protograph spatially coupled (SC) low-density…

cs.IT2025

Ensemble Average Analysis of Non-Adaptive Group Testing with Sparse Pooling Graphs

Emna Ben Yacoub, Gianluigi Liva, Enrico Paolini +1

A combinatorial analysis of the false alarm (FA) and misdetection (MD) probabilities of non-adaptive group testing with sparse pooling graphs is developed. The analysis targets the…

cs.IT2025

Error Detection Based on Generalized Successive Cancellation List Decoding for Polar Codes

Alexander Sauter, Mustafa Cemil Coşkun, Gianluigi Liva

Successive cancellation list (SCL) decoding has been widely adopted for polar codes, which allows near maximum likelihood performance with sufficiently large list size. In this wor…

cs.IT2025

Density Evolution Analysis of Sparse-Block IDMA

Jean-Francois Chamberland, Gianluigi Liva, Krishna Narayanan

Sparse block interleaver division multiple access (SB-IDMA) is a recently introduced unsourced multiple access protocol that aims to improve the performance of the grant-free two-s…

cs.IT2025

Undetected Error Probability in the Short Blocklength Regime: Approaching Finite-Blocklength Bounds with Polar Codes

Alexander Sauter, A. Oguz Kislal, Giuseppe Durisi +3

We analyze the trade-off between the undetected error probability (i.e., the probability that the channel decoder outputs an erroneous message without detecting the error) and the…

cs.IT2024

Unsourced Multiple Access: A Coding Paradigm for Massive Random Access

Gianluigi Liva, Yury Polyanskiy

This paper is a tutorial introduction to the field of unsourced multiple access (UMAC) protocols. We first provide a historical survey of the evolution of random access protocols,…

cs.IT2024

Evolution of the 5G New Radio Two-Step Random Access towards 6G Unsourced MAC

Patrick Agostini, Jean-Francois Chamberland, Federico Clazzer +7

This report summarizes some considerations on possible evolutions of grant-free random access in the next generation of the 3GPP wireless cellular standard. The analysis is carried…

cs.IT2024

Design and Performance of Enhanced Spread Spectrum Aloha for Unsourced Multiple Access

Riccardo Schiavone, Gianluigi Liva, Roberto Garello

We analyze the performance of enhanced spread spectrum Aloha (E-SSA) in the framework of unsourced multiple access (UMAC). The asynchronous, unframed transmission of E-SSA is modif…

cs.IT2023

Error-Correction Performance of Regular Ring-Linear LDPC Codes over Lee Channels

Jessica Bariffi, Hannes Bartz, Gianluigi Liva +1

Most low-density parity-check (LDPC) code constructions are considered over finite fields. In this work, we focus on regular LDPC codes over integer residue rings and analyze their…

cs.IT2023★ 7 cited

Soft-Information Post-Processing for Chase-Pyndiah Decoding Based on Generalized Mutual Information

Andreas Straßhofer, Diego Lentner, Gianluigi Liva +1

Chase-Pyndiah decoding is widely used for decoding product codes. However, this method is suboptimal and requires scaling the soft information exchanged during the iterative proces…

cs.IT2023

Learning-Based Rich Feedback HARQ for Energy-Efficient Uplink Short Packet Transmission

Martin Voigt Vejling, Federico Chiariotti, Anders Ellersgaard Kalør +3

The trade-off between reliability, latency, and energy efficiency is a central problem in communication systems. Advanced hybrid automated repeat request (HARQ) techniques reduce r…

cs.IT2023

Rate-Adaptive Protograph MacKay-Neal Codes

Ayman Zahr, Balazs Matuz, Gianluigi Liva

A class of rate-adaptive protograph MacKay-Neal (MN) codes is introduced and analyzed. The code construction employs an outer distribution matcher (DM) to adapt the rate of the sch…

cs.IT2023★ 2 cited

Remote Monitoring of Two-State Markov Sources via Random Access Channels: an Information Freshness vs. State Estimation Entropy Perspective

Giuseppe Cocco, Andrea Munari, Gianluigi Liva

We study a system in which two-state Markov sources send status updates to a common receiver over a slotted ALOHA random access channel. We characterize the performance of the syst…

cs.IT2023

The Dynamic Behavior of Frameless ALOHA: Drift Analysis, Throughput, and Age of Information

Andrea Munari, Francisco Lazaro, Giuseppe Durisi +1

We study the dynamic behavior of frameless ALOHA, both in terms of throughput and age of information (AoI). In particular, differently from previous studies, our analysis accounts…

cs.IT2022

Finite Blocklength Performance Bound for the DNA Storage Channel

Issam Maarouf, Gianluigi Liva, Eirik Rosnes +1

We present a finite blocklength performance bound for a DNA storage channel with insertions, deletions, and substitutions. The considered bound -- the dependency testing (DT) bound…

cs.IT2022

On the Performance of Irregular Repetition Slotted ALOHA with an Age of Information Threshold

Hooman Asgari, Andrea Munari, Gianluigi Liva

The present paper focuses on an IoT setting in which a large number of devices generate time-stamped updates addressed to a common gateway. Medium access is regulated following a g…

cs.IT2021

An Age of Information Characterization of Frameless ALOHA

Andrea Munari, Francisco Lázaro, Giuseppe Durisi +1

We provide a characterization of the peak age of information (AoI) achievable in a random-access system operating according to the frameless ALOHA protocol. Differently from previo…

cs.IT2021

On the Properties of Error Patterns in the Constant Lee Weight Channel

Jessica Bariffi, Hannes Bartz, Gianluigi Liva +1

The problem of scalar multiplication applied to vectors is considered in the Lee metric. Unlike in other metrics, the Lee weight of a vector may be increased or decreased by the pr…

cs.IT2021

Analysis of Low-Density Parity-Check Codes over Finite Integer Rings for the Lee Channel

Jessica Bariffi, Hannes Bartz, Gianluigi Liva +1

We study the performance of nonbinary low-density parity-check (LDPC) codes over finite integer rings over two channels that arise from the Lee metric. The first channel is a discr…

cs.IT2021

Information Freshness Analysis of Slotted ALOHA in Gilbert-Elliot Channels

Andrea Munari, Gianluigi Liva

This letter analyzes a class of information freshness metrics for large IoT systems in which terminals employ slotted ALOHA to access a common channel. Considering a Gilbert- Ellio…

cs.IT2021

Optimum Detection of Defective Elements in Non-Adaptive Group Testing

Gianluigi Liva, Enrico Paolini, Marco Chiani

We explore the problem of deriving a posteriori probabilities of being defective for the members of a population in the non-adaptive group testing framework. Both noiseless and noi…