Synthesis of Binary k-Stage Machines

TL;DR

This paper introduces an algorithm that constructs the shortest binary k-stage machine for a given sequence, extending the Berlekamp-Massey algorithm to handle non-linear cases.

Contribution

It presents a novel algorithm that generalizes the Berlekamp-Massey algorithm for non-linear binary sequence generation.

Findings

Algorithm effectively constructs minimal binary k-stage machines.

Extension of Berlekamp-Massey to non-linear sequences.

Potential applications in sequence analysis and cryptography.

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.