Answers are grounded in this paper and cite their sources.
This correspondence deals with the fault-tolerant realization of a sequential machine using error-correcting (n,k) linear codes. Earlier works in the same area confine their attention to modified Reed-Muller Code and perfect Hamming Code and achieve the realization using a number of majority logic gates, which makes the entire realization quite complex. The realization discussed in this paper needs a smaller number of circuit components with less complexity.
No takes yet. Share an insight, caveat, or question.
Sengupta et al. (1981) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: