Talk:Balanced Boolean function

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computer science This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science ??? This article has not yet received a rating on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}} Mathematics Low‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics Low This article has been rated as Low-priority on the project's priority scale.

Currently, the following examples are given

An example of a balanced boolean function is the function that assigns a 1 to every even number and 0 to all odd numbers (likewise the other way around). The same applies for functions assigning 1 to all positive numbers and 0 otherwise.

• Regarding the first example: even numbers and odd numbers are of type integer, not of type boolean - therefore the first example is not an example of an boolean function.
• Regarding the second example: 0 is usually understood as being neither positive nor negative. Therefore there will be one more element in the set that is assigned 0 compared to the set that is assigned 1. Is it correct to still speak of this function being balanced?

--Abdull (talk) 17:32, 5 September 2010 (UTC)Reply

This page was copied from the abstract of the article cited!

It needs to be deleted or re-written. — Preceding unsigned comment added by 131.122.6.28 (talk) 12:21, 20 March 2012 (UTC)Reply

In my opinion, this article is very weak. I have never edited wikipedia but I have two suggestions. These should make the article more useful for researchers.

1. Mention some elementary properties of balanced boolean functions.

Example 1: a balanced boolean function of dimension D+1 can be created by concatenating any dimension D boolean function with its complement. Example 2: balanced boolean functions have the unique property that their complement is also balanced. Example 3: The randomization lemma (See the famous coding theory book by Sloane and MacWilliams)

2. Mention the Cusick-Cheon conjecture.

The Cusick-Cheon conjecture deals with a fundamental characterization of balanced boolean functions in terms of the degree of their algebraic normal form representation.

It is very likely that the Cusick-Cheon conjecture is true because it is backed by good numerical evidence although it has only been proven in special cases. — Preceding unsigned comment added by 24.179.214.114 (talk) 21:54, 31 May 2019 (UTC)Reply