Maximum likelihood decoding of certain Reed - Muller codes (Corresp.)
G. Seroussi, Abraham Lempel · IEEE Transactions on Information Theory · 1983
We present an efficient maximum likelihood decoding algorithm for the punctured binary Reed-Muller code of order(m - 3)and length2^{m} - 1, M \geq 3, and we give formulas for the weight distribution of coset leaders of such codes.