Prove that code C is uniquely decodable if the extension $C^k(x_1,x_2,...,x_k)=C(x_1)C(x_2)...C(x_k)$ is a one-to-one mapping from $\mathcal{X}^k$ to $D^*$ for every $k\geq1$.
I know that for uniquely decodable codes, they must be one-to-one representations, but I think stating that as a proof is too simplistic—I'd expect I need to show that it has to be a one-to-one mapping rather than relying on such a definition. And I can't 'show' it here, as I could with example 2 bit codes.
HINT: If $C$ is not uniquely decodable, there are $k$, $\ell$, $\langle x_1,\ldots,x_k\rangle\in\mathscr{X}^k$, and $\langle y_1,\ldots,y_\ell\rangle\in\mathscr{X}^\ell$ such that $\langle x_1,\ldots,x_k\rangle\ne\langle y_1,\ldots,y_\ell\rangle$, but $C^k(x_1,\ldots,x_k)=C^\ell(y_1,\ldots,y_\ell)$. Use this to show that $C^{k+\ell}$ is not one-to-one.