In Remark B.1 from this paper it says:
We assume canonical representation for binary fields $\mathbb{F}$, given by an irreducible polynomial and a primitive element $g \in \mathbb{F}$ for it (i.e., $g$ generates $\mathbb{F}^*$). We use the standard basis {${1, g, g^2, ..., g^{n-1}}$} to represent $\mathbb{F}_{2^n}$ over $\mathbb{F}_2$.
I think I understand the first sentence, but the second sentence confuses me. Shouldn't there be $2^{n}-1$ elements generated by $g$? If so, the elements would be {${1, g, g^2, ..., g^{2^n-1}}$} - right? Am I missing something?