Abstract: An arrangement for decoding a data word using a Reed-Muller code, has: (1) N input terminals, (2) a first level of E>>D summing modules, each summing module being linked with F different input terminals and each input terminal being linked with E summing modules, (3) a first level of E decision modules, each of the D inputs of each decision module being linked respectively with an output from D different summing modules, (4) a second level of H summing modules, (5) a second level of G decision modules, (6) a third level of G summing modules, and (7) G output terminals. N signifies the code length and D signifies the minimum spacing of the code, E is equal to D-2, F is equal to N/D, G is the number of symbols of the data word that need to be corrected and is a natural number between 1 and E<<D.

Abstract: An arrangement is provided for decoding a data word with the aid of a Reed-Muller code, which consists of the following components: (1) N input terminals, (2) a first level of E<<D summing modules, wherein each summing module of the first level is linked with F different input terminals and each input terminal is linked with E summing modules of the first level, (3) a first level of E decision modules, wherein each of the D inputs of each decision module is linked respectively with an output from D different summing modules from the first level of the summing modules, (4) a second level of H summing modules, wherein each summing module is linked with a decision module from the first level of the decision modules and with a summing module from the first level of the summing modules, (5) a second level of G decision modules, wherein each of the E inputs of each decision module is linked respectively with an output from E different summing modules from the second level of the summing modules, (6) a third l