Skip to main content
Journal ArticleOPEN ACCESS

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

Discrete Applied Mathematics (2001) 114(1-3) 227-231
DOI: 10.1016/S0166-218X(00)00371-1
0Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.

This article is free to access.

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. © 2001 Elsevier Science B.V.

Author supplied keywords

Cite

CITATION STYLE

APA

Merekin, Y. V. (2001). Upper bounds for the complexity of sequences generated by symmetric Boolean functions. Discrete Applied Mathematics, 114(1–3), 227–231. https://doi.org/10.1016/S0166-218X(00)00371-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free