We consider the redundancy of the exact channel synthesis problem under an i.i.d. assumption. Existing results provide an upper bound on the unnormalized redundancy that is logarithmic in the block length. We show, via an improved scheme, that the logarithmic term can be halved for most channels and eliminated for all others. For full-support discrete memoryless channels, we show that this is the best possible.

翻译：我们研究了在独立同分布假设下精确信道合成问题的冗余。现有结果给出，未归一化冗余的上界与块长呈对数关系。通过一种改进方案，我们证明大多数信道的对数项可减半，而其余信道的对数项可完全消除。对于满支撑离散无记忆信道，我们证明这是可能达到的最优结果。