activity
20052026
most citedConstellation Optimization in the Presence of Strong Phase Noise

81 citations · 749 across the 99 of their papers we have counts for

collaborators
Showing 2018 · cs.ITShow all

10 papers · 2 filters

cs.IT2018

Energy-Efficient Soft-Assisted Product Decoders

Christoffer Fougstedt, Alireza Sheikh, Alexandre Graell i Amat +2

We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-nm technology. The decoder uses one bit of soft information to improve its net coding gain by 0.2 dB, reachi…

cs.IT2018★ 2 cited

A Droplet Approach Based on Raptor Codes for Distributed Computing With Straggling Servers

Albin Severinson, Alexandre Graell i Amat, Eirik Rosnes +2

We propose a coded distributed computing scheme based on Raptor codes to address the straggler problem. In particular, we consider a scheme where each server computes intermediate…

cs.IT2018

Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes

Siddhartha Kumar, Hsuan-Yin Lin, Eirik Rosnes +1

We prove that a class of distance-optimal local reconstruction codes (LRCs), an important family of repair-efficient codes for distributed storage systems, achieve the maximum dist…

cs.IT2018★ 2 cited

Private Information Retrieval From a Cellular Network With Caching at the Edge

Siddhartha Kumar, Alexandre Graell i Amat, Eirik Rosnes +1

We consider the problem of downloading content from a cellular network where content is cached at the wireless edge while achieving privacy. In particular, we consider private info…

cs.IT2018★ 6 cited

On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage

Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes +1

We consider private information retrieval (PIR) for distributed storage systems (DSSs) with noncolluding nodes where data is stored using a non maximum distance separable (MDS) lin…

cs.IT2018

On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems

Alireza Sheikh, Alexandre Graell i Amat, Gianluigi Liva +2

We study low-complexity iterative decoding algorithms for product codes. We revisit two algorithms recently proposed by the authors based on bounded distance decoding (BDD) of the…