Eberhard Karls Universitaet Tuebingen

Eberhard-karls-universitat Tubingen

Peter Hauck

Juliane Bertram

Michael Huber

An arrangement for decoding a data word using a Reed-Muller code, has: (1) N input terminals, (2) a first level of E&#x3e;&#x3e;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&#x3c;&#x3c;D.

Growing community of inventors

Balingen, Germany

Peter Hauck