Abstract
In this paper, an algorithm for the construction of correlation-immune functions is given. It will be shown that the proposed algorithm provides a method to construct every ruth order correlationimmune function. Besides correlation-immunity, also other properties of Boolean functions, llke Hamming weight, can be taken into account. The complexity analysis of the proposed algorithm leads to a new upper bound for the number of specified correlation-immune functions and correlation-immune functions in general, depending on the number of input variables n and the order of correlation-immunity.
Cite
CITATION STYLE
Schneider, M. (1997). A note on the construction and upper bounds of correlation-immune functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1355, pp. 295–306). Springer Verlag. https://doi.org/10.1007/bfb0024475
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
