From wikipedia, I know that Gold codes have length $2^n-1$, where $n$ is number of LFSR elements and that there are $2^n-1$ different Gold sequences for this case. E.g. assuming that $n=6$, I have a Gold sequence with a length of $63$ bits. But how many users can I differentiate with this?
On the one hand I would have said that I can differentiate $2^{2^n-1}$, i.e. in this case $2^{63}$ users because there are $63$ bits that can either be $0$ or $1$. But on the other hand, wikipedia says there are only $2^n-1$ Gold sequences with that length which would imply that I can also serve $2^n-1$ users.
Or the question asked the other way around: If I have to address $K$ users, each by means of an unique code, how many bits for the Gold codes do I need?
Edit: Moreover, I found this page that says that there are only $6$ different Gold sequences with a length of $63$ bits.