Title of article
Upper bounds for the complexity of sequences generated by symmetric Boolean functions Original Research Article
Author/Authors
Yu.V. Merekin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
5
From page
227
To page
231
Abstract
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.
Keywords
Symbolic sequences , Complexity
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885303
Link To Document