Balanced Boolean function: Difference between revisions

Revision as of 23:11, 21 February 2010

Revision as of 23:13, 21 February 2010

Line 1:

In [[mathematics]] and [[computer science]], a '''balanced boolean function''' is a [[boolean function]] whose output yields as many '''0'''s as '''1'''s over its [[Domain of a function|input set]]. This means that for a uniformly random input string of bits, the probability of getting a one'''1''' is 1/2.

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.

== Usage ==

Balanced boolean functions are primarily used in [[cryptography]].

== See also ==