论文标题
成本的有限状态渠道的费率约束的塑造代码
Rate-Constrained Shaping Codes for Finite-State Channels With Cost
论文作者
论文摘要
整形代码用于生成符号遵守规定概率分布的代码序列。它们自然出现在源代码编码不平等符号成本的无噪声渠道的背景下。最近，已经提出了整形代码来延长闪存的寿命并减少DNA合成时间。在本文中，我们研究了一般的成本和成本和i.i.d.无噪声有限国家渠道的塑形代码。来源。我们建立了代码速率与最低平均符号成本之间的关系。然后，我们确定最小化每个源符号的平均成本（总成本）的速率。在最小化平均符号成本和最小化总成本的代码之间建立了等效性，并证明了分离定理，这表明可以通过最佳压缩和最佳构造来实现最佳成型。来源。
Shaping codes are used to generate code sequences in which the symbols obey a prescribed probability distribution. They arise naturally in the context of source coding for noiseless channels with unequal symbol costs. Recently, shaping codes have been proposed to extend the lifetime of flash memory and reduce DNA synthesis time. In this paper, we study a general class of shaping codes for noiseless finite-state channels with cost and i.i.d. sources. We establish a relationship between the code rate and minimum average symbol cost. We then determine the rate that minimizes the average cost per source symbol (total cost). An equivalence is established between codes minimizing average symbol cost and codes minimizing total cost, and a separation theorem is proved, showing that optimal shaping can be achieved by a concatenation of optimal compression and optimal shaping for a uniform i.i.d. source.
