Synthesis of Binary k-Stage Machines
classification
💻 cs.CR
keywords
algorithmbinaryk-stageberlekamp-masseycaseconsideredconstructingextension
read the original abstract
An algorithm for constructing a shortest binary k-stage machine generating a given binary sequence is presented. This algorithm can be considered as an extension of Berlekamp-Massey algorithm to the non-linear case.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.