Upper bounds for the complexity of sequences generated by symmetric Boolean functions Original Research Article

A quadratic upper bound is obtained for the complexity of symbol sequences generated by symmetric Boolean functions in concatenation schemes. A more precise bound is established for sequences generated by belt symmetric functions. Also, a linear upper bound is obtained for a particular subclass of sequences.