2014 IEEE 44th International Symposium on Multiple-Valued Logic (ISMVL) (2014)

Bremen, Germany

May 19, 2014 to May 21, 2014

ISSN: 0195-623X

ISBN: 978-1-4799-3535-2

pp: 13-18

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISMVL.2014.11

ABSTRACT

In this paper we consider S-threshold functions defined on not necessarily binary input. By S-threshold function, in an arbitrary dimension we mean a function which can be written as a linear combination of monomials from a predefined set. First, we determine sets of discrete moments which uniquely determine such functions. Based on these, we derive a generic formula for the upper bound of the functions considered. The formula is generic because it works in all dimensions, on any input size, and for any set of monomials used to define certain S-threshold function. Even though the formula is very generic it gives some improvements of the well-known results.

INDEX TERMS

Upper bound, Encoding, Educational institutions, Performance analysis, Image coding

CITATION

J. Pantovic, S. Ghilezan and J. unic, "On the Number of S-Threshold Functions on Not Necessarily Binary Input,"

*2014 IEEE 44th International Symposium on Multiple-Valued Logic (ISMVL)*, Bremen, Germany, 2014, pp. 13-18.

doi:10.1109/ISMVL.2014.11

CITATIONS