Talk:Balanced Boolean function: Difference between revisions

Revision as of 21:55, 31 May 2019

Revision as of 18:30, 15 July 2019

Line 16:

It needs to be deleted or re-written. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/131.122.6.28|131.122.6.28]] ([[User talk:131.122.6.28|talk]]) 12:21, 20 March 2012 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->

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.

Line 23 ⟶ 24:

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 MacDonald)

2. Mention the Cusick-Cheon conjecture.