The Reed Muller codes are a class of multiple error correcting linear codes with a geometry.
This paper investigates some properties of this code, describes two decoding schemes, and looks at the efficiency of these codes according to three bounds on linear codes.
