# balanced function (thing)

Return to balanced function (thing)

A boolean function is said to be balanced if it outputs 1 (one) half of the time and 0 (zero) the other half, across all possible inputs. This can be extended to functions over other finite fields (GF(q In the boolean case, if a function f (GF(2
As an example, let's look at the output of a boolean function (GF(2 f(x x As we can see, over all 8 possible combinations of inputs you get zero 4 times as output and you get one 4 times as well, which indicates that this boolean function (called "majority function") is balanced. | Existing:- boolean function
- balance
- output
- one
- zero
- input
- finite field
- Galois Field
- function
- surjective
- element
- codomain
- probability
- boolean
- function
- concatenation
- balanced function
- AND
- OR
- zero
- one
- boolean function
- majority function
- balanced function
Non-Existing: |