一种改进的中短分组码球填充有界目标码及其应用
An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications
摘要：
本文推导了一种改进的球填充（ISP）界短到中等块长的目标码。我们首先回顾了1967年的球形包装（SP67）的离散无记忆通道，以及最近的改进由Valvis和Fossorier。这些概念被用于推导一个新的下界的解码错误概率（称为ISP界），这是一致的紧比SP67界及其最近的改进版本。在较弱的条件下，ISP界也适用于一般的无记忆信道，并给出了它的一些应用实例。它的紧密性进行了研究，通过比较它与ML解码错误概率的界限。它是举例说明，ISP界建议一个有趣的替代1959年球形包装（SP59）的香农界的高斯信道，特别是数字调制的高频谱效率。
英文摘要：
This paper derives an improved sphere-packing (ISP) bound targeting codes of short to moderate block lengths. We first review the 1967 sphere-packing (SP67) bound for discrete memoryless channels, and a recent improvement by Valembois and Fossorier. These concepts are used for the derivation of a new lower bound on the decoding error probability (referred to as the ISP bound) which is uniformly tighter than the SP67 bound and its recent improved version. Under a mild condition, the ISP bound is applicable to general memoryless channels, and some of its applications are exemplified. Its tightness is studied by comparing it with bounds on the ML decoding error probability. It is exemplified that the ISP bound suggests an interesting alternative to the 1959 sphere-packing (SP59) bound of Shannon for the Gaussian channel, especially for digital modulations of high spectral efficiency.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
