65 citations · 143 across the 21 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.IT2023★ 1 cited
Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting
Emmanuel Abbe, Colin Sandon
This paper shows that a class of codes such as Reed-Muller (RM) codes have vanishing bit-error probability below capacity on symmetric channels. The proof relies on the notion of `…
cs.IT2023
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels
Emmanuel Abbe, Colin Sandon
Reed-Muller codes were introduced in 1954, with a simple explicit construction based on polynomial evaluations, and have long been conjectured to achieve Shannon capacity on symmet…
math.PR2023
The Power of an Adversary in Glauber Dynamics
Byron Chin, Ankur Moitra, Elchanan Mossel +1
Glauber dynamics are a natural model of dynamics of dependent systems. While originally introduced in statistical physics, they have found important applications in the study of so…