无记忆信道的球填充界
The Sphere Packing Bound For Memoryless Channels
摘要：
球包装界（SPBs）-与前置因子是多项式的块长度-推导出代码上的两个家庭的无记忆信道使用奥古斯丁的方法：（可能是非平稳）无记忆信道（可能是多个）添加剂成本约束和固定的无记忆信道凸约束的组成（即经验分布，类型）的输入码字。Gallager的界的一个变种，以表明这些球包装界是紧的错误概率的指数衰减率与块长度在温和的假设。
英文摘要：
Sphere packing bounds (SPBs) ---with prefactors that are polynomial in the block length--- are derived for codes on two families of memoryless channels using Augustin's method: (possibly non-stationary) memoryless channels with (possibly multiple) additive cost constraints and stationary memoryless channels with convex constraints on the composition (i.e. empirical distribution, type) of the input codewords. A variant of Gallager's bound is derived in order to show that these sphere packing bounds are tight in terms of the exponential decay rate of the error probability with the block length under mild hypotheses.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
