Alexandre Graell i Amat

research

∙ 08/16/2023

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

Chase-Pyndiah decoding is widely used for decoding product codes. Howeve...

0 Andreas Straßhofer, et al. ∙

research

∙ 05/09/2023

Balancing Privacy and Security in Federated Learning with FedGT: A Group Testing Framework

We propose FedGT, a novel framework for identifying malicious clients in...

0 Marvin Xhemrishi, et al. ∙

research

∙ 02/23/2023

Irregular Repetition Slotted ALOHA Over the Binary Adder Channel

We propose an irregular repetition slotted ALOHA (IRSA) based random-acc...

0 Khac-Hoang Ngo, et al. ∙

research

∙ 02/21/2023

Unsourced Multiple Access with Common Alarm Messages: Network Slicing for Massive and Critical IoT

We investigate the coexistence of massive and critical Internet of Thing...

0 Khac-Hoang Ngo, et al. ∙

research

∙ 01/28/2023

Rateless Autoencoder Codes: Trading off Decoding Delay and Reliability

Most of today's communication systems are designed to target reliable me...

0 Vukan Ninkovic, et al. ∙

research

∙ 12/20/2022

Index-Based Concatenated Codes for the Multi-Draw DNA Storage Channel

We consider error-correcting coding for DNA-based storage. We model the ...

0 Lorenz Welter, et al. ∙

research

∙ 12/19/2022

Finite Blocklength Performance Bound for the DNA Storage Channel

We present a finite blocklength performance bound for a DNA storage chan...

0 Issam Maarouf, et al. ∙

research

∙ 12/14/2022

Achievable Information Rates and Concatenated Codes for the DNA Nanopore Sequencing Channel

The errors occurring in DNA-based storage are correlated in nature, whic...

0 Issam Maarouf, et al. ∙

research

∙ 11/30/2022

Improving the Thresholds of Generalized LDPC Codes with Convolutional Code Constraints

CC-GLPDC codes are a class of generalized low-density parity-check (GLDP...

0 Muhammad Umar Farooq, et al. ∙

research

∙ 03/16/2022

Finite-Length Scaling of SC-LDPC Codes With a Limited Number of Decoding Iterations

We propose four finite-length scaling laws to predict the frame error ra...

0 Roman Sokolovskii, et al. ∙

research

∙ 02/28/2022

Computational Code-Based Privacy in Coded Federated Learning

We propose a privacy-preserving federated learning (FL) scheme that is r...

0 Marvin Xhemrishi, et al. ∙

research

∙ 02/16/2022

Error Floor Analysis of Irregular Repetition ALOHA

With the rapid expansion of the Internet of Things, the efficient sharin...

0 Federico Clazzer, et al. ∙

research

∙ 02/13/2022

Unsourced Multiple Access With Random User Activity

To account for the massive uncoordinated random access scenario, which i...

0 Khac-Hoang Ngo, et al. ∙

research

∙ 01/24/2022

Generalized Spatially-Coupled Parallel Concatenated Codes With Partial Repetition

A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed gener...

0 Min Qiu, et al. ∙

research

∙ 12/16/2021

CodedPaddedFL and CodedSecAgg: Straggler Mitigation and Secure Aggregation in Federated Learning

We present two novel coded federated learning (FL) schemes for linear re...

0 Reent Schlegel, et al. ∙

research

∙ 12/02/2021

Age of Information in Prioritized Random Access

Age of information (AoI) is a performance metric that captures the fresh...

0 Khac-Hoang Ngo, et al. ∙

research

∙ 11/29/2021

Concatenated Codes for Multiple Reads of a DNA Sequence

Decoding sequences that stem from multiple transmissions of a codeword o...

0 Issam Maarouf, et al. ∙

research

∙ 11/27/2021

DSAG: A mixed synchronous-asynchronous iterative method for straggler-resilient learning

We consider straggler-resilient learning. In many previous works, e.g., ...

0 Albin Severinson, et al. ∙

research

∙ 10/07/2021

Privacy-Preserving Coded Mobile Edge Computing for Low-Latency Distributed Inference

We consider a mobile edge computing scenario where a number of devices w...

0 Reent Schlegel, et al. ∙

research

∙ 09/30/2021

Coding for Straggler Mitigation in Federated Learning

We present a novel coded federated learning (FL) scheme for linear regre...

0 Siddhartha Kumar, et al. ∙

research

∙ 08/17/2021

Rateless Codes for Low-Latency Distributed Inference in Mobile Edge Computing

We consider a mobile edge computing scenario where users want to perform...

0 Anton Frigård, et al. ∙

research

∙ 05/03/2021

Generalized Spatially Coupled Parallel Concatenated Convolutional Codes With Partial Repetition

We introduce generalized spatially coupled parallel concatenated codes (...

0 Min Qiu, et al. ∙

research

∙ 04/22/2021

On Doped SC-LDPC Codes for Streaming

In streaming applications, doping improves the performance of spatially-...

0 Roman Sokolovskii, et al. ∙

research

∙ 04/16/2021

Autoencoder-Based Unequal Error Protection Codes

We present a novel autoencoder-based approach for designing codes that p...

0 Vukan Ninkovic, et al. ∙

research

∙ 04/14/2021

Dynamic Coded Caching in Wireless Networks Using Multi-Agent Reinforcement Learning

We consider distributed caching of content across several small base sta...

0 Jesper Pedersen, et al. ∙

research

∙ 03/17/2021

Massive Uncoordinated Access With Random User Activity

We extend the seminal work by Polyanskiy (2017) on massive uncoordinated...

0 Khac-Hoang Ngo, et al. ∙

research

∙ 02/21/2021

Privacy-Preserving Wireless Federated Learning Exploiting Inherent Hardware Impairments

We consider a wireless federated learning system where multiple data hol...

0 Sina Rezaei Aghdam, et al. ∙

research

∙ 12/24/2020

Analysis and Design of Partially Information- and Partially Parity-Coupled Turbo Codes

In this paper, we study a class of spatially coupled turbo codes, namely...

0 Min Qiu, et al. ∙

research

∙ 11/27/2020

Pruning and Quantizing Neural Belief Propagation Decoders

We consider near maximum-likelihood (ML) decoding of short linear block ...

0 Andreas Buchberger, et al. ∙

research

∙ 11/04/2020

Learned Decimation for Neural Belief Propagation Decoders

We introduce a two-stage decimation process to improve the performance o...

0 Andreas Buchberger, et al. ∙

research

∙ 10/29/2020

Concatenated Codes for Recovery From Multiple Reads of DNA Sequences

Decoding sequences that stem from multiple transmissions of a codeword o...

0 Andreas Lenz, et al. ∙

research

∙ 08/16/2020

Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding

A product code with single parity-check component codes can be seen as a...

0 Mustafa Cemil Coşkun, et al. ∙

research

∙ 08/05/2020

Novel High-Throughput Decoding Algorithms for Product and Staircase Codes based on Error-and-Erasure Decoding

Product codes (PCs) and staircase codes (SCCs) are conventionally decode...

0 Alireza Sheikh, et al. ∙

research

∙ 07/17/2020

Multi-Server Weakly-Private Information Retrieval

Private information retrieval (PIR) protocols ensure that a user can dow...

0 Hsuan-Yin Lin, et al. ∙

research

∙ 05/29/2020

Refined Reliability Combining for Binary Message Passing Decoding of Product Codes

We propose a novel soft-aided iterative decoding algorithm for product c...

0 Alireza Sheikh, et al. ∙

research

∙ 05/18/2020

Private Edge Computing for Linear Inference Based on Secret Sharing

We consider an edge computing scenario where users want to perform a lin...

0 Reent Schlegel, et al. ∙

research

∙ 03/09/2020

Finite-Length Scaling of Spatially Coupled LDPC Codes Under Window Decoding Over the BEC

We analyze the finite-length performance of spatially coupled low-densit...

0 Roman Sokolovskii, et al. ∙

research

∙ 02/19/2020

Dynamic Coded Caching in Wireless Networks

We consider distributed and dynamic caching of coded content at small ba...

0 Jesper Pedersen, et al. ∙

research

∙ 01/23/2020

The Capacity of Single-Server Weakly-Private Information Retrieval

A private information retrieval (PIR) protocol guarantees that a user ca...

0 Hsuan-Yin Lin, et al. ∙

research

∙ 01/21/2020

Pruning Neural Belief Propagation Decoders

We consider near maximum-likelihood (ML) decoding of short linear block ...

0 Andreas Buchberger, et al. ∙

research

∙ 09/19/2019

Coding for Optical Communications – Can We Approach the Shannon Limit With Low Complexity?

Approaching capacity with low complexity is a very challenging task. In ...

0 Alexandre Graell i Amat, et al. ∙

research

∙ 08/26/2019

On Parameter Optimization of Product Codes for Iterative Bounded Distance Decoding with Scaled Reliability

We use density evolution to optimize the parameters of binary product co...

0 Alireza Sheikh, et al. ∙

research

∙ 06/06/2019

Symbol Message Passing Decoding of Nonbinary Low-Density Parity-Check Codes

We present a novel decoding algorithm for q-ary low-density parity-check...

0 Francisco Lázaro, et al. ∙

research

∙ 05/14/2019

Coded Distributed Tracking

We consider the problem of tracking the state of a process that evolves ...

0 Albin Severinson, et al. ∙

research

∙ 04/23/2019

A Refined Scaling Law for Spatially Coupled LDPC Codes Over the Binary Erasure Channel

We propose a refined scaling law to predict the finite-length performanc...

0 Roman Sokolovskii, et al. ∙

research

∙ 02/27/2019

One and Two Bit Message Passing for SC-LDPC Codes with Higher-Order Modulation

High throughput and low complexity decoding algorithms are necessary in ...

0 Fabian Steiner, et al. ∙

research

∙ 02/10/2019

Binary Message Passing Decoding of Product-like Codes

We propose a novel binary message passing decoding algorithm for product...

0 Alireza Sheikh, et al. ∙

research

∙ 01/20/2019

Weakly-Private Information Retrieval

Private information retrieval (PIR) protocols make it possible to retrie...

0 Hsuan-Yin Lin, et al. ∙

research

∙ 01/09/2019

Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding

We propose a binary message passing decoding algorithm for product codes...

0 Alireza Sheikh, et al. ∙

research

∙ 10/29/2018

Energy-Efficient Soft-Assisted Product Decoders

We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-...

0 Christoffer Fougstedt, et al. ∙

Alexandre Graell i Amat

Featured Co-authors