Hazla, JanSamorodnitsky, AlexSberlo, Ori2022-07-182022-07-182022-07-182021-01-0110.1145/3406325.3451015https://infoscience.epfl.ch/handle/20.500.14299/189316WOS:000810492500126We strengthen the results from a recent work by the second author, achieving bounds on the weight distribution of binary linear codes that are successful under block-MAP (as well as bit-MAP) decoding on the BEC. We conclude that a linear code that is successful on the BEC can also decode over a range of binary memoryless symmetric (BMS) channels. In particular, applying the result of Kudekar, Kumar, Mondelli, Pfister, Sasoglu and Urbanke from STOC 2016, we prove that a Reed-Muller code of positive rate R decodes errors on the BSC (p) with high probability if p < 1/2 - root 2(-R)(1 - 2(-R)).Computer Science, Theory & MethodsOperations Research & Management ScienceMathematics, AppliedComputer ScienceMathematicscapacity-achieving codesweight enumeratorreed-muller codesthresholdcapacitytext::conference output::conference proceedings::conference paper