具有增广反馈的DSPC的球Packing界
The Sphere Packing Bound for DSPCs with Feedback a la Augustin
摘要：
建立球包装界的分组码的离散固定产品渠道的反馈-这通常被称为离散无记忆渠道的反馈-被认为是一个开放的问题，直到最近，尽管证明草图Augustin在1978年提供。一个完整的证明以下奥古斯丁的证明草图，以证明其充分性，并提请注意两个新的想法，它采用。这些新的想法（即，Augustin的平均和子块的使用）很可能适用于其他通信问题，以建立不可能性结果。
英文摘要：
Establishing the sphere packing bound for block codes on the discrete stationary product channels with feedback ---which are commonly called the discrete memoryless channels with feedback--- was considered to be an open problem until recently, notwithstanding the proof sketch provided by Augustin in 1978. A complete proof following Augustin's proof sketch is presented, to demonstrate its adequacy and to draw attention to two novel ideas it employs. These novel ideas (i.e., the Augustin's averaging and the use of subblocks) are likely to be applicable in other communication problems for establishing impossibility results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
