activity
20192022
collaborators

5 papers

cs.IT2022

Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing

Alejandro Lancho, Alexander Fengler, Yury Polyanskiy

We present finite-blocklength achievability bounds for the unsourced A-channel. In this multiple-access channel, users noiselessly transmit codewords picked from a common codebook…

cs.IT2021

On Joint Detection and Decoding in Short-Packet Communications

Alejandro Lancho, Johan Östman, Giuseppe Durisi

We consider a communication problem in which the receiver must first detect the presence of an information packet and, if detected, decode the message carried within it. We present…

cs.IT2021

Cell-free Massive MIMO with Short Packets

Alejandro Lancho, Giuseppe Durisi, Luca Sanguinetti

In this paper, we adapt to cell-free Massive MIMO (multiple-input multiple-output) the finite-blocklength framework introduced by Östman et al. (2020) for the characterization of t…

cs.IT2019

Short-Packet Transmission over a Bidirectional Massive MIMO link

Johan Östman, Alejandro Lancho, Giuseppe Durisi

We consider the transmission of short packets over a bidirectional communication link where multiple devices, e.g., sensors and actuators, exchange small-data payloads with a base…

cs.IT2019

Saddlepoint Approximations for Short-Packet Wireless Communications

Alejandro Lancho, Jöhan Ostman, Giuseppe Durisi +2

In recent years, the derivation of nonasymptotic converse and achievability bounds on the maximum coding rate as a function of the error probability and blocklength has gained atte…