Abstract
The set of correlation immune (CI) Boolean functions can be partitioned into several disjoint sets depending on the Hamming weight of their output column. We show that the number of n variable CI functions of Hamming weight 2 a+2 is strictly greater than the number of such functions of weight 2 a for 2 a<2 n−1 . This seemingly intuitive result turns out to be quite difficult to prove. The combinatorial structure of CI functions revealed here reduces the enumeration problem of CI functions to the enumeration problem of balanced CI functions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
