List decoding of the first-order binary Reed-Muller codes
Ilya I. Dumer, Grigory A. Kabatiansky, Cédric Tavernier · Problems of Information Transmission · 2007
A list decoding algorithm is designed for the first-order binary Reed-Muller codes of length n that reconstructs all codewords located within the ball of radius n/2(1 − ɛ) about the received vector and has the complexity of O(n ln2(min{ɛ −2, n})) binary operations.