13 citations · 43 across the 11 of their papers we have counts for
11 papers · 1 filter
Concentration without Independence via Information Measures
Amedeo Roberto Esposito, Marco Mondelli
We propose a novel approach to concentration for non-independent random variables. The main idea is to ``pretend'' that the random variables are independent and pay a multiplicativ…
The price of ignorance: how much does it cost to forget noise structure in low-rank matrix estimation?
Jean Barbier, TianQi Hou, Marco Mondelli +1
We consider the problem of estimating a rank-1 signal corrupted by structured rotationally invariant noise, and address the following question: how well do inference algorithms per…
Polar Coded Computing: The Role of the Scaling Exponent
Dorsa Fathollahi, Marco Mondelli
We consider the problem of coded distributed computing using polar codes. The average execution time of a coded computing system is related to the error probability for transmissio…
Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes
Seyyed Ali Hashemi, Marco Mondelli, Arman Fazeli +3
This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the nu…
Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes
Dorsa Fathollahi, Nariman Farsad, Seyyed Ali Hashemi +1
Reed-Muller (RM) codes are one of the oldest families of codes. Recently, a recursive projection aggregation (RPA) decoder has been proposed, which achieves a performance that is c…
Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes
Marco Mondelli, Seyyed Ali Hashemi, John Cioffi +1
This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike c…