Therefore, we maximize C satisfying the constraint that Out of the V − C rare words, we would like to pack them into a complete tree so that they may be encoded using our remaining W − C symbols.
we maximize C satisfying the constraint that No-Repeats.