26 citations · 137 across the 41 of their papers we have counts for
4 papers · 1 filter
Construction of Polar Codes with Sublinear Complexity
Marco Mondelli, S. Hamed Hassani, Rüdiger Urbanke
Consider the problem of constructing a polar code of block length for the transmission over a given channel . Typically this requires to compute the reliability of all the $…
Capacity-Achieving Rate-Compatible Polar Codes for General Channels
Marco Mondelli, S. Hamed Hassani, Ivana Marić +2
We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-…
Reed-Muller Codes Achieve Capacity on Erasure Channels
Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli +3
We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relyin…
Comparing the Bit-MAP and Block-MAP Decoding Thresholds of Reed-Muller Codes on BMS Channels
Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli +2
The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure ch…