Login / Signup
Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting.
Emmanuel Abbe
Colin Sandon
Published in:
CoRR (2023)
Keyphrases
</>
error probability
upper bound
lower bound
machine learning
combining multiple
error criterion