If this is not the case, you can always derive an equivalent code by adding extra symbols ( with associated null probabilities ), to make the code complete while keeping it " biunique ".
2.
For any code that is " biunique ", meaning that the code is " uniquely decodeable ", the sum of the probability budgets across all symbols is always less than or equal to one.