this is for holding javascript data
Massimiliano Sala edited bits2.tex
over 7 years ago
Commit id: cb4e2cc4fe215638e9015bbc98934a70d3f0aa53
deletions | additions
diff --git a/bits2.tex b/bits2.tex
index 30fbbea..653815a 100644
--- a/bits2.tex
+++ b/bits2.tex
...
Each polynomial $f \in \Fb[x]$ can be seen as a function $f: \Fb \rightarrow \Fb $,
such that
%$$f: \Fb \rightarrow \Fb $$
$$ 0 \mapsto f(0)
$$
$$ \qquad 1 \mapsto f(1) $$
where $f(i), i \in \Fb$ is the bit we get by substituting $x$ with $i$ in $f$
and simplifying the obtained expression.
\begin{Example}\label{Eval}