Conversions between different boolean function
representations:
There are many representations for a boolean function. The
advantage of each representation depends on the application that is using the
boolean function. In this website, we deal with three representations:
the truth table, the algebraic normal form and the trace
representation. In fact the truth table representation is the default
representation of boolean functions since it can be constructed from the
definition of the boolean function. The algebraic normal form is the usually
most used representation in cryptography and coding while the trace
representation is used in sequence theory. In this page we convert between
the three different representations.
For more information about how to enter your boolean function and how the
conversions work, click on the links below: