The word $w=\sa{0000101101}$ is a binary $(4,10)$-ring sequence, its cyclic (distinct) factors of length $k=4$ are: $$ \sa{0000}, \sa{0001}, \sa{0010}, \sa{0101}, \sa{1011},$$ $$ \sa{0110}, \sa{1101}, \sa{1010}, \sa{0100}, \sa{1000}.$$
It is very simple to construct a word of length $n\le 2^k$ such that all its $k$-factors are distinct: we can take a prefix of de Bruijn word of rank $k$.
The difficulty grows substantially when we require that all cyclic $k$-factors are distinct. Such words of length $n$ were called $(k,n)$-ring sequences in [Yoeli 1962]. Of course we should have $1\le n\le 2^k$.