On the set of uniquely decodable codes with a given sequence of code word lengths

Adam Woryna

For every natural number $n\ge 2$ and every finite sequence $L$ of natural numbers, we consider the set $U{D}_n(L)$ of all uniquely decodable codes over an $n$-letter alphabet with…