Complexity of Circuit Implementation of Reed’s Algorithm and Decoding in an Automaton

The author obtains upper bounds for the number of functional elements in circuits which implement Reed’s decoding algorithm and threshold decoding of maximum-length codes. It is shown that decoders are inapplicable for error correction in an automaton memory unit when there are races between the internal elements.