 Solution

For $m=2^b$, assign every outcome one of the $b$-bit words. This complete fixed-length prefix code has expected length $b$ and meets the information entropy lower bound.